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

DOI10.1109/18.75251MaRDI QIDQ5753887zbMATH OpenOpenAlexFDO

Authors Charles T. Retter

Publication date 1991

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.75251

zbMATH Keywords

generalized Reed-Solomon codesself-intersecting codesweight-enumerator

Mathematics Subject Classification ID

Cyclic codes (94B15)

Recommendations

• An average weight-distance enumerator for binary expansions of Reed-Solomon codes
• The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
• scientific article; zbMATH DE number 4193605
• On the Complete Weight Enumerator of Reed-Solomon Codes
• The binary weight distribution of the extended (2 m,2 m-4) code of the Reed-Solomon code over GF(2 m) with generator polynomial (x- )(x- 2)(x- 3)

Cited in

(6)

• The binary weight distribution of the extended (2 m,2 m-4) code of the Reed-Solomon code over GF(2 m) with generator polynomial (x- )(x- 2)(x- 3)
• The average of joint weight enumerators
• Constructions of asymmetric quantum alternant codes
• Gaps in the binary weight distributions of Reed-Solomon codes
• An average weight-distance enumerator for binary expansions of Reed-Solomon codes
• The geometry of intersecting codes and applications to additive combinatorics and factorization theory

This page was built for publication: The average binary weight-enumerator for a class of generalized Reed-Solomon codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5753887)