Title :
Lower bounds for q-ary covering codes
Author :
Chen, Wende ; Honkala, Iiro S.
Author_Institution :
Inst. of Syst. Sci., Acad. Sinica, Beijing, China
fDate :
5/1/1990 12:00:00 AM
Abstract :
The authors prove combinatorial lower bounds for Kq (n,R), the minimal cardinality of any q-ary code of length n and covering radius R. Tables of lower bounds for Kq(n,R) are presented for q=3, 4, 5
Keywords :
codes; combinatorial mathematics; combinatorial lower bounds; covering radius; minimal cardinality; q-ary covering codes; Error correction codes; Hamming distance; Mathematics; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
