Existence of small ordered orthogonal arrays
From MaRDI portal
Abstract: We show that there exist ordered orthogonal arrays, whose sizes deviate from the Rao bound by a factor that is polynomial in the parameters of the ordered orthogonal array. The proof is nonconstructive and based on a probabilistic method due to Kuperberg, Lovett and Peled.
Recommendations
Cites work
- A General Construction of Ordered Orthogonal Arrays Using LFSRs
- A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets
- An equivalence between (T,M,S)-nets and strongly orthogonal hypercubes
- Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
- Codes for the \(m\)-metric
- scientific article; zbMATH DE number 1229678 (Why is no real title available?)
- scientific article; zbMATH DE number 1734711 (Why is no real title available?)
- scientific article; zbMATH DE number 3430682 (Why is no real title available?)
- Nontrivial t-designs over finite fields exist for all t
- Ordered Orthogonal Array Construction Using LFSR Sequences
- Orthogonal arrays. Theory and applications
- Probabilistic existence of regular combinatorial structures
This page was built for publication: Existence of small ordered orthogonal arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064434)