An upper bound on the weight distribution of some systematic codes (Corresp.)
Philippe Piret · IEEE Transactions on Information Theory · 1985
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).