On the Number of $1$-Perfect Binary Codes: A Lower Bound

DOI10.1109/TIT.2008.917692zbMath1328.94084arXivmath/0608278OpenAlexW3121152837MaRDI QIDQ3604528

Sergei V. Avgustinovich, Denis S. Krotov

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0608278

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (7)

Partitions into perfect codes in the Hamming and Lee metrics ⋮ Embedding in a perfect code ⋮ On existence of perfect bitrades in Hamming graphs ⋮ On the size of the symmetry group of a perfect code ⋮ On perfect codes for an additive channel ⋮ Indistinguishable Sceneries on the Boolean Hypercube ⋮ Unnamed Item

This page was built for publication: On the Number of $1$-Perfect Binary Codes: A Lower Bound