DocumentCode
1410308
Title
Several new lower bounds on the size of codes with covering radius one
Author
Blass, Uri ; Litsyn, Simon
Author_Institution
Dept. of Electr. Eng., Tel Aviv Univ., Israel
Volume
44
Issue
5
fYear
1998
fDate
9/1/1998 12:00:00 AM
Firstpage
1998
Lastpage
2002
Abstract
We derive several new lower bounds on the size of binary codes with covering radius one. In particular, we prove K(9,1)⩾57 (the best known lower bound was 55) and K(11,1)⩾180 (178)
Keywords
binary sequences; codes; binary codes; code size; covering radius; lower bounds; Binary codes; Block codes; Error correction codes; Hamming distance; Publishing;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.705582
Filename
705582
Link To Document