DocumentCode
2000361
Title
The multicovering radii of linear codes with 1-covering radius one
Author
Mertz, Andrew
Author_Institution
Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA
fYear
2003
fDate
29 June-4 July 2003
Firstpage
15
Abstract
The multicovering radius is a generalization of the covering radius that was proposed by Klapper (1997) in the course of studying stream ciphers. Klapper showed that there exist stream ciphers that are resistant to synthesis attacks. The purpose of this paper is to determine the 2-covering radius of linear codes with 1-covering radius one. A technique for determining multicovering radii is illustrated and has generated a new bound.
Keywords
linear codes; vectors; 1-covering radius one; even weight codes; linear codes; multicovering radii; stream ciphers; vectors; Computer science; Linear code; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN
0-7803-7728-1
Type
conf
DOI
10.1109/ISIT.2003.1228029
Filename
1228029
Link To Document