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

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.