The classification of orthogonal arrays OA(2048,14,2,7) and some completely regular codes
From MaRDI portal
Publication:6204340
Recommendations
Cites work
- scientific article; zbMATH DE number 1256667 (Why is no real title available?)
- A bound on correlation immunity
- Classification algorithms for codes and designs
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Construction of mixed orthogonal arrays with high strength
- Integer programming for classifying orthogonal arrays
- Nonexistence of a few binary orthogonal arrays
- On Multifold Packings of Radius-1 Balls in Hamming Graphs
- On completely regular codes
- On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
- On unbalanced Boolean functions with best correlation immunity
- Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds
- Orthogonal arrays. Theory and applications
- Practical graph isomorphism. II.
- 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
- Translation-invariant propelinear codes
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)