On the number of 1-perfect binary codes: a lower bound
arXiv:math/0608278 · doi:10.1109/TIT.2008.917692
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.
5pp(Eng)+7pp(Rus) V2: revised V3: + Russian version, + references