Title :
The average binary weight-enumerator for a class of generalized Reed-Solomon codes
Author :
Retter, Charles T.
Author_Institution :
Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA
fDate :
3/1/1991 12:00:00 AM
Abstract :
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
Keywords :
error correction codes; asymptotically good codes; average binary weight-enumerator; binary codes; generalized Reed-Solomon codes; self-intersecting codes; Binary codes; Hamming weight; Neural networks; Reed-Solomon codes;
Journal_Title :
Information Theory, IEEE Transactions on
