On the number of 1-perfect binary codes: a lower bound
Combinatorics
2009-09-25 v3
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.
Cite
@article{arxiv.math/0608278,
title = {On the number of 1-perfect binary codes: a lower bound},
author = {Denis Krotov and Sergey Avgustinovich},
journal= {arXiv preprint arXiv:math/0608278},
year = {2009}
}
Comments
5pp(Eng)+7pp(Rus) V2: revised V3: + Russian version, + references