Existence of small ordered orthogonal arrays

DOI10.1002/jcd.21903zbMath1526.05020arXiv2109.01586OpenAlexW3196799052MaRDI QIDQ6064434

Kai-Uwe Schmidt, Unnamed Author

Publication date: 9 November 2023

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.01586

zbMATH Keywords

existenceordered orthogonal arraysRao bound

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nontrivial \(t\)-designs over finite fields exist for all \(t\)
• Orthogonal arrays. Theory and applications
• Codes for the \(m\)-metric
• An equivalence between \((T,M,S)\)-nets and strongly orthogonal hypercubes
• Probabilistic existence of regular combinatorial structures
• Ordered Orthogonal Array Construction Using LFSR Sequences
• A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets
• Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
• A General Construction of Ordered Orthogonal Arrays Using LFSRs

This page was built for publication: Existence of small ordered orthogonal arrays