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
fDate :
9/1/1998 12:00:00 AM
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;
Journal_Title :
Information Theory, IEEE Transactions on
