Nonexistence of a few binary orthogonal arrays

DOI10.1016/J.DAM.2016.07.023MaRDI QIDQ516803zbMATH OpenOpenAlexFDO

Authors Peter Boyvalenkov, Tanya Marinova, 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

zbMATH Keywords

binary Hamming spacedistance distributionsKrawtchouk polynomialsnonexistenceorthogonal arrays

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

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)$=(9,6.2^4=96,4)$, $(10,6.2^5,5)$, $(10,7.2^4=112,4)$, $(11,7.2^5,5)$, $(11,7.2^4,4)$ and $(12,7.2^5,5)$, 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).

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

• An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays
• Association schemes and coding theory
• Classification of orthogonal arrays by integer programming
• Complete enumeration of pure-level and mixed-level orthogonal arrays
• Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
• Estimates of the capacity of orthogonal arrays of large strength
• scientific article; zbMATH DE number 1284419 (Why is no real title available?)
• Investigation of binary orthogonal arrays via their distance distributions
• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• Nonexistence of binary orthogonal arrays via their distance distributions
• On Orthogonal Arrays
• Orthogonal arrays. Theory and applications

Cited in

(24)

• Nonexistence of (9, 112, 4) and (10, 224, 5) binary orthogonal arrays
• \(D\)-optimal augmented designs and the existence of tight orthogonal arrays with high strength
• On distance distributions of orthogonal arrays
• Investigation of binary orthogonal arrays via their distance distributions
• On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
• On unbalanced Boolean functions with best correlation immunity
• Simplicity conditions for binary orthogonal arrays
• Nonexistence of binary orthogonal arrays via their distance distributions
• Application of Orthogonal Polynomials and Special Matrices to Orthogonal Arrays
• scientific article; zbMATH DE number 4128822 (Why is no real title available?)
• The Nonexistence of a Binary Homogeneous Pseudoplane
• scientific article; zbMATH DE number 7360437 (Why is no real title available?)
• The Hamming distances of saturated asymmetrical orthogonal arrays with strength 2
• Computing Distance Distributions of Ternary Orthogonal Arrays
• Nonexistence of certain binary orthogonal arrays
• On (4,9,96) binary orthogonal arrays
• scientific article; zbMATH DE number 2235056 (Why is no real title available?)
• Existence of small ordered 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
• Hamming distances of tight orthogonal arrays
• The construction of optimal orthogonal arrays with repeated rows and strength 2
• Hamming distances of unsaturated orthogonal arrays
• New bounds on the covering radius of orthogonal arrays of even strength

Describes a project that uses

Uses Software

• Orthogonal Array

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)