DocumentCode
2443697
Title
Improved lower bounds for multicovering codes
Author
Klapper, Andrew
Author_Institution
Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA
fYear
1998
fDate
16-21 Aug 1998
Firstpage
51
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708631
Filename
708631
Link To Document