Title :
Lower Bounds for Binary Codes of Covering Radius One
Author_Institution :
Albert-Ludwigs-Univ. Freiburg, Freiburg
Abstract :
Let K(n, l) denote the minimal cardinality of a binary code of length n and covering radius one. Blass and Litsyn proved a lower bound K(n, l) for in the case n equiv 5 (mod6). We give a simplification of the proof, which yields a slightly better result.
Keywords :
binary codes; binary code; covering radius; lower bound; Binary codes; Error correction codes; Galois fields; Hamming distance; Binary code; covering radius; lower bounds;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2007.901186
