By Topic

The average binary weight-enumerator for a class of generalized Reed-Solomon codes

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
$33 $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)
C. T. Retter ; Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA

An explicit weight-enumerator for the set of binary expansions of a class of generalized Reed-Solomon codes is derived. This enumerator is then used to show that most of these binary codes are asymptotically good, and to bound the rates of self-intersecting codes

Published in:

IEEE Transactions on Information Theory  (Volume:37 ,  Issue: 2 )