Nonexistence of a few binary orthogonal arrays
From MaRDI portal
Publication:516803
DOI10.1016/J.DAM.2016.07.023zbMATH Open1358.05041arXiv1604.06117OpenAlexW2963316060MaRDI QIDQ516803FDOQ516803
Authors: Peter Boyvalenkov, Tanya Marinova, M. M. Stoyanova
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract: We develop and apply combinatorial algorithms for investigation of the feasible distance distributions of binary orthogonal arrays with respect to a point of the ambient binary Hamming space utilizing constraints imposed from the relations between the distance distributions of connected arrays. This turns out to be strong enough and we prove the nonexistence of binary orthogonal arrays of parameters (length, cardinality, strength), , , , and , resolving the first cases where the existence was undecided so far. For the existing arrays our approach allows substantial reduction of the number of feasible distance distributions which could be helpful for classification results (uniqueness, for example).
Full work available at URL: https://arxiv.org/abs/1604.06117
Recommendations
- Nonexistence of binary orthogonal arrays via their distance distributions
- Nonexistence of certain binary orthogonal arrays
- Nonexistence of (9, 112, 4) and (10, 224, 5) binary orthogonal arrays
- Investigation of binary orthogonal arrays via their distance distributions
- On distance distributions of orthogonal arrays
Cites Work
- Orthogonal arrays. Theory and applications
- Association schemes and coding theory
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Investigation of binary orthogonal arrays via their distance distributions
- Estimates of the capacity of orthogonal arrays of large strength
- Nonexistence of binary orthogonal arrays via their distance distributions
- On Orthogonal Arrays
- Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
- Title not available (Why is that?)
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
- Classification of orthogonal arrays by integer programming
- An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays
Cited In (21)
- On distance distributions of orthogonal arrays
- Nonexistence of (9, 112, 4) and (10, 224, 5) binary orthogonal arrays
- The Hamming distances of saturated asymmetrical orthogonal arrays with strength 2
- Hamming distances of tight orthogonal arrays
- Title not available (Why is that?)
- Title not available (Why is that?)
- Existence of small ordered orthogonal arrays
- Computing Distance Distributions of Ternary Orthogonal Arrays
- Application of Orthogonal Polynomials and Special Matrices to Orthogonal Arrays
- Nonexistence of binary orthogonal arrays via their distance distributions
- Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods
- On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
- The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes
- \(D\)-optimal augmented designs and the existence of tight orthogonal arrays with high strength
- Simplicity conditions for binary orthogonal arrays
- Title not available (Why is that?)
- On unbalanced Boolean functions with best correlation immunity
- The Nonexistence of a Binary Homogeneous Pseudoplane
- Nonexistence of certain binary orthogonal arrays
- On (4,9,96) binary orthogonal arrays
- Investigation of binary orthogonal arrays via their distance distributions
Uses Software
This page was built for publication: Nonexistence of a few binary orthogonal arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516803)