DocumentCode
1747990
Title
The multicovering radii of the even weight codes
Author
Mertz, Andrew
Author_Institution
Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA
fYear
2001
fDate
2001
Firstpage
14
Abstract
The multicovering radius is a generalization of the covering radius that was proposed by Klapper (1997) in the course of studying stream ciphers. Given a code of length n, the m-covering radius is the smallest radius such that every m-tuple of vectors in the ambient space of the code is contained in a ball of that radius centered around some codeword. We are interested in the properties of codes with almost minimal m-covering radii. In this paper we study the multicovering radii of the even weight code
Keywords
codes; ambient space; covering radius; even weight codes; m-covering radius; minimal m-covering radii; multicovering radius; Computer science; Petroleum; Poles and towers; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location
Washington, DC
Print_ISBN
0-7803-7123-2
Type
conf
DOI
10.1109/ISIT.2001.935877
Filename
935877
Link To Document