Author :
Cohen, Gerard D. ; Encheva, Sylvia B. ; Zemor, Gilles
Author_Institution :
ENST, Paris, France
Abstract :
We show that almost all codes satisfy an antichain condition. This states that the minimum length of a two dimensional subcode of C increases if the subcode is constrained to contain a minimum weight codeword. In particular, almost no code satisfies the chain condition
Keywords :
binary codes; linear codes; antichain codes; binary linear codes; minimum length; minimum weight codeword; two dimensional subcode; Educational institutions; Equations; Genetic expression; Linear code; Vectors;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708836
