On enumeration of the perfect binary codes of length 15
From MaRDI portal
Publication:3148512
DOI10.1016/S0166-218X(02)00303-7zbMath1008.94026MaRDI QIDQ3148512
Publication date: 6 October 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://math.nsc.ru/publishing/DAOR/daor.html
Related Items
Affine 3-nonsystematic perfect codes of length 15 ⋮ Perfect binary codes of infinite length ⋮ Switching codes and designs ⋮ On perfect binary codes ⋮ Full rank perfect codes and \(\alpha \)-kernels
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On nonsystematic perfect binary codes.
- Switching equivalence classes of perfect codes
- A binary perfect code of length 15 and codimension 0
- Kernels of nonlinear Hamming codes
- A Combinatorial Construction of Perfect Codes
- Nonsystematic perfect codes
- Perfect binary codes: constructions, properties, and enumeration
- On a lower bound on the number of perfect binary codes
- On nonsystematic perfect binary codes of length 15