By Topic

An upper bound on the weight distribution of some systematic codes (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Piret, P. ; Canon Research Centre France, Cesson-Sévigné, France

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 weightlfloor omega n rfloorcannot be much larger than2^{kH(omega).

Published in:

Information Theory, IEEE Transactions on  (Volume:31 ,  Issue: 4 )