Title :
Improved lower bounds for multicovering codes
Author_Institution :
Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA
Abstract :
This paper gives improved lower bounds on the size of the smallest codes exhibiting a given multicovering radius. These bounds are improvements on generalized sphere bounds for multicovering radii. The case of a binary code is examined
Keywords :
binary codes; binary code; code length; code size; generalized sphere bounds; lower bounds; multicovering codes; multicovering radius; Binary codes; Computer science; Hamming distance;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708631
