On enumeration of the perfect binary codes of length 15
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3831840 (Why is no real title available?)
- scientific article; zbMATH DE number 1037961 (Why is no real title available?)
- scientific article; zbMATH DE number 1420999 (Why is no real title available?)
- A Combinatorial Construction of Perfect Codes
- A binary perfect code of length 15 and codimension 0
- Kernels of nonlinear Hamming codes
- Nonsystematic perfect codes
- On a lower bound on the number of perfect binary codes
- On nonsystematic perfect binary codes of length 15
- On nonsystematic perfect binary codes.
- Perfect binary codes: constructions, properties, and enumeration
- Switching equivalence classes of perfect codes
Cited in
(10)- Switching codes and designs
- On enumeration of nonequivalent perfect binary codes of length 15 and rank 15
- On nonsystematic perfect binary codes of length 15
- Perfect binary codes of infinite length
- Binary perfect and extended perfect codes of lengths 15 and 16 and of ranks 13 and 14
- Full rank perfect codes and -kernels
- On perfect binary codes
- Affine 3-nonsystematic perfect codes of length 15
- On a lower bound on the number of perfect binary codes
- scientific article; zbMATH DE number 1811354 (Why is no real title available?)
This page was built for publication: On enumeration of the perfect binary codes of length 15
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3148512)
