Title :
Improved lower bounds for multicovering codes
Author_Institution :
Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA
fDate :
11/1/1999 12:00:00 AM
Abstract :
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
Keywords :
binary codes; error correction codes; Hamming radius; asymptotic lower bounds; binary code; code length; codeword; error correcting codes; improved lower bounds; m-covering radius; m-tuples; multicovering codes; smallest code; vectors; Binary codes; Cryptography; Error correction codes; Galois fields; Linear code; Welding;
Journal_Title :
Information Theory, IEEE Transactions on
