Improved Lower Bounds for Multicovering Codes

IEEE Transactions on Information Theory 45 (1999) 2532-2534.

Andrew Klapper, 779A Anderson Hall, Dept. of Computer Science, University of Kentucky, Lexington, KY, 40506-0046, klapper at

Abstract The m-covering radius of a code is a recent generalization of the covering radius of a code. It is the smallest t such that every m-tuple of vectors is contained in a ball of Hamming radius centered at some codeword. We derive new lower bounds for the size of the smallest code that has a given length and m-covering radius.