The multicovering radii of the even weight codes

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.