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 inDesigns, codes, and cryptography Vol. 91; no. 7; pp. 2605 - 2625
Main Authors Chen, Guangzhou, Niu, Xiaodong
Format Journal Article
LanguageEnglish
Published New York Springer US 01.07.2023
Springer Nature B.V
Subjects
Coding and Information Theory
Combinatorial analysis
Computer Science
Cryptography
Cryptology
Design of experiments
Discrete Mathematics in Computer Science
Orthogonal arrays
Large set
Kronecker product
05B15
Mixed
Orthogonal arrays
Online AccessGet full text

Cover

More Information
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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-1022
1573-7586
DOI:10.1007/s10623-023-01217-5