Multicovering Bounds from Relative Covering Radii

The multicovering radii of a code are recently introduced natural generalizations of the covering radius measuring the smallest radius of balls around codewords that cover all m-tuples of vectors. In this paper we prove a new identity relating the multicovering radii of a code to a relativized notion of ordinary covering radius. This identity is used to prove new bounds on the multicovering radii of particular codes. 1

• Type: Journal
• Year: 2002
• Where: SIAMDM
• Authors: Iiro S. Honkala, Andrew Klapper
• Keywords: Covering Radius, Radii, SIAMDM 2002, Smallest Radius