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

DOI10.1109/TIT.2008.917692MaRDI QIDQ3604528zbMATHOpenAlexFDO

Authors Denis S. Krotov, Sergey Avgustinovich

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)

Abstract: We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

Cited in

(8)

• On existence of perfect bitrades in Hamming graphs
• On the size of the symmetry group of a perfect code
• scientific article; zbMATH DE number 7300318 (Why is no real title available?)
• On perfect codes for an additive channel
• Partitions into perfect codes in the Hamming and Lee metrics
• Indistinguishable sceneries on the Boolean hypercube
• Robust tracking control of the variable stiffness actuator based on the lever mechanism
• Embedding in a perfect code

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604528)