The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes
From MaRDI portal
Publication:6204340
DOI10.1016/j.disc.2024.113923arXiv2311.05428OpenAlexW4391707761WikidataQ128180427 ScholiaQ128180427MaRDI QIDQ6204340
Publication date: 27 March 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2311.05428
Graph theory (including graph drawing) in computer science (68R10) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial codes (94B25)
Cites Work
- Unnamed Item
- Nonexistence of a few binary orthogonal arrays
- Classification algorithms for codes and designs
- Orthogonal arrays. Theory and applications
- Construction of mixed orthogonal arrays with high strength
- On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
- On unbalanced Boolean functions with best correlation immunity
- Practical graph isomorphism. II.
- A bound on correlation immunity
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Translation-invariant propelinear codes
- Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds
- The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification
- On Multifold Packings of Radius-1 Balls in Hamming Graphs
- The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
- Integer Programming for Classifying Orthogonal Arrays
- On completely regular codes
This page was built for publication: The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes
