The classification of orthogonal arrays OA(2048,14,2,7) and some completely regular codes
arXiv:2311.05428 · doi:10.1016/j.disc.2024.113923
Abstract
We describe the classification of orthogonal arrays OA, or, equivalently, completely regular -codes in the -cube ( equivalence classes). In particular, we find that there is exactly one almost-OA, up to equivalence. As derived objects, OA ( classes) and completely regular - and -codes in the - and -cubes, respectively, are also classified. Keywords: binary orthogonal array, completely regular code, binary 1-perfect code.
arXiv commentv2: revised, corrected, representation of the almost-OA(2048,14,2,7+1) updated; v3: accepted version (minor revision)
References in corpus (5)
- The Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification
- The Perfect Binary One-Error-Correcting Codes of Length 15: Part II--Properties
- On the OA(1536,13,2,7) and related orthogonal arrays
- Integer Programming for Classifying Orthogonal Arrays
- On multifold packings of radius-1 balls in Hamming graphs