DocumentCode :
1108172
Title :
On the Number of 
-Perfect Binary Codes: A Lower Bound
Author :
Krotov, Denis S. ; Avgustinovich, Sergey V.
Author_Institution :
Sobolev Inst. of Math., Novosibirsk
Volume :
54
Issue :
4
fYear :
2008
fDate :
4/1/2008 12:00:00 AM
Firstpage :
1760
Lastpage :
1765
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.
Keywords :
binary codes; 1-perfect binary codes; lower bound; Binary codes; Hamming distance; Mathematics; Upper bound; Automorphism; lower bound; perfect binary codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2008.917692
Filename :
4475376
Link To Document :
