By Topic

The multicovering radii of linear codes with 1-covering radius one

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Mertz, A. ; Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA

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.

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003