Improved lower bounds for multicovering codes

The m-covering radius of a code is a 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 t 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.