Nonexistence of a few binary orthogonal arrays
From MaRDI portal
Publication:516803
DOI10.1016/j.dam.2016.07.023zbMath1358.05041arXiv1604.06117OpenAlexW2963316060MaRDI QIDQ516803
Tanya Marinova, P. G. Boyvalenkov, M. M. Stoyanova
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.06117
Related Items
The Hamming distances of saturated asymmetrical orthogonal arrays with strength 2 ⋮ Simplicity conditions for binary orthogonal arrays ⋮ Unnamed Item ⋮ On distance distributions of orthogonal arrays ⋮ Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods ⋮ The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes ⋮ Application of Orthogonal Polynomials and Special Matrices to Orthogonal Arrays ⋮ Nonexistence of (9, 112, 4) and (10, 224, 5) binary orthogonal arrays ⋮ On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays ⋮ \(D\)-optimal augmented designs and the existence of tight orthogonal arrays with high strength ⋮ On unbalanced Boolean functions with best correlation immunity
Uses Software
Cites Work
- Unnamed Item
- Nonexistence of binary orthogonal arrays via their distance distributions
- An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays
- Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
- Orthogonal arrays. Theory and applications
- Investigation of binary orthogonal arrays via their distance distributions
- Classification of orthogonal arrays by integer programming
- Estimates of the capacity of orthogonal arrays of large strength
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Association schemes and coding theory
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
- On Orthogonal Arrays
