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

DOI10.1109/TIT.2008.917692zbMATH Open1328.94084arXivmath/0608278OpenAlexW3121152837MaRDI QIDQ3604528FDOQ3604528

Authors: Denis S. Krotov, Sergey Avgustinovich 

Publication date: 24 February 2009

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

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.

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

Mathematics Subject Classification ID

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

Cited In (8)

• Partitions into perfect codes in the Hamming and Lee metrics
• Robust tracking control of the variable stiffness actuator based on the lever mechanism
• On existence of perfect bitrades in Hamming graphs
• Embedding in a perfect code
• On perfect codes for an additive channel
• Title not available (Why is that?)
• On the size of the symmetry group of a perfect code
• Indistinguishable Sceneries on the Boolean Hypercube

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)