arXiv Analytics

Sign in

arXiv:math/0608278 [math.CO]AbstractReferencesReviewsResources

On the number of 1-perfect binary codes: a lower bound

Denis Krotov, Sergey Avgustinovich

Published 2006-08-11, updated 2009-09-25Version 3

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.

Comments: 5pp(Eng)+7pp(Rus) V2: revised V3: + Russian version, + references
Journal: IEEE Trans. Inf. Theory 54(4) 2008, 1760-1765
Categories: math.CO
Subjects: 94B25, 05A16
Related articles: Most relevant | Search more
arXiv:0907.0002 [math.CO] (Published 2009-07-01)
On the binary codes with parameters of doubly-shortened 1-perfect codes
arXiv:1405.3780 [math.CO] (Published 2014-05-15)
Hadamard Z2Z4Q8-codes. Constructions based on the rank and dimension of the kernel
arXiv:1401.3601 [math.CO] (Published 2014-01-15, updated 2015-10-19)
Construction of some perfect integral lattices with minimum 4

Links

Toolbox