Abstract:
For a class of binary systematic codes of lengthnand cardinality2^{k}, including the class of linear(n, k)binary cyclic codes, it is shown that the number of codewords of...Show MoreMetadata
Abstract:
For a class of binary systematic codes of lengthnand cardinality2^{k}, including the class of linear(n, k)binary cyclic codes, it is shown that the number of codewords of weight\lfloor \omega n \rfloorcannot be much larger than2^{kH(\omega).
Published in: IEEE Transactions on Information Theory ( Volume: 31, Issue: 4, July 1985)