Constructions for new orthogonal arrays based on large sets of orthogonal arrays

Orthogonal array is one of the important research subjects in combinatorial design theory and experimental design theory, and it is widely applied to statistics, computer science, coding theory and cryptography. There are many constructions and results for orthogonal array of strength 2, however the...

Full description

Saved in:
Bibliographic Details
Published in:Designs, codes, and cryptography codes, and cryptography, 2023-07, Vol.91 (7), p.2605-2625
Main Authors: Chen, Guangzhou, Niu, Xiaodong
Format: Article
Language:English
Subjects:
Coding and Information Theory
Combinatorial analysis
Computer Science
Cryptography
Cryptology
Design of experiments
Discrete Mathematics in Computer Science
Orthogonal arrays
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Orthogonal array is one of the important research subjects in combinatorial design theory and experimental design theory, and it is widely applied to statistics, computer science, coding theory and cryptography. There are many constructions and results for orthogonal array of strength 2, however the results on orthogonal array of strength t ≥ 3 are rare. In this paper, we first present two new effective constructions for orthogonal arrays of strength t ≥ 3 based on large sets of orthogonal arrays. Second, many infinite families of large sets of orthogonal arrays are obtained and then some new series of orthogonal array of strength t ≥ 3 are produced.
ISSN:0925-1022
1573-7586
DOI:10.1007/s10623-023-01217-5