The classification of orthogonal arrays OA(2048,14,2,7) and some completely regular codes
DOI10.1016/J.DISC.2024.113923arXiv2311.05428OpenAlexW4391707761WikidataQ128180427 ScholiaQ128180427MaRDI QIDQ6204340FDOQ6204340
Authors: Denis S. Krotov 
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial codes (94B25)
Cites Work
- Practical graph isomorphism. II.
- Orthogonal arrays. Theory and applications
- The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification
- The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
- Classification algorithms for codes and designs
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- A bound on correlation immunity
- Title not available (Why is that?)
- Nonexistence of a few binary orthogonal arrays
- Translation-invariant propelinear codes
- Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds
- Integer programming for classifying orthogonal arrays
- On completely regular codes
- Construction of mixed orthogonal arrays with high strength
- On unbalanced Boolean functions with best correlation immunity
- On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
- On Multifold Packings of Radius-1 Balls in Hamming Graphs
Cited In (1)
- [[Publication:6643242|Equitable \([[2, 10], [6, 6]]\)-partitions of the 12-cube]]
This page was built for publication: The classification of orthogonal arrays \(\mathrm{OA}(2048,14,2,7)\) and some completely regular codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204340)
