Title :
New lower bounds for binary covering codes
Author :
Li, Dongfeng ; Chen, Wende
Author_Institution :
Dept. of Math., Guangdong Inst. of Technol., China
fDate :
7/1/1994 12:00:00 AM
Abstract :
Lower bounds for K(n, R), the minimal number of codewords of any binary code of length n and covering radius R, are improved. The definition of multiexcess is introduced. A technique combining van Wee´s (1991) method and linear inequalities for covering codes is used. A revised table for K(n, R) (n⩽33, R⩽10) is given
Keywords :
binary sequences; codes; binary covering codes; code length; codewords; covering radius; linear inequalities; lower bounds; multiexcess; Binary codes; Error correction codes; Linear programming; Mathematics; Vectors;
Journal_Title :
Information Theory, IEEE Transactions on
