Title :
Every binary (2m-2, 22(m)-2-m, 3) code can be lengthened to form a perfect code of length 2m-1
Author_Institution :
Centre for Commun. Res., Bristol Univ., UK
fDate :
3/1/1999 12:00:00 AM
Abstract :
We answer a problem posed by Etzion and Vardy (1998) by showing that a binary code of length N=2(m)-2 with 2(N-m) codewords and minimum distance three can always be lengthened to form a perfect code of length 2(m-1)
Keywords :
binary codes; binary code; codewords; length; lengthened code; minimum distance; perfect code; Polynomials;
Journal_Title :
Information Theory, IEEE Transactions on
