Title :
Lower bounds for binary covering codes
Author :
Honkala, Iiro S.
Author_Institution :
Dept. of Math., Turku Univ., Finland
fDate :
3/1/1988 12:00:00 AM
Abstract :
G.D. Chen et al. (ibid., vol.IT-32, p.680-94, 1986) presented two new lower bounds for K(n,R), where K(n,R) denotes the minimum cardinality of a binary code of length n and covering radius R. The author shows that a slight modification gives further improvements and some examples are given to confirm the argument. Codes that have a certain partitioning property are considered
Keywords :
error correction codes; binary covering codes; error correcting codes; lower bounds; minimum cardinality; partitioning property; Binary codes; Data compression; Decoding; Entropy; Error correction codes; Hamming distance; Source coding;
Journal_Title :
Information Theory, IEEE Transactions on
