An average weight-distance enumerator for binary expansions of Reed-Solomon codes

DOI10.1109/18.995649zbMATH Open1061.94076OpenAlexW2152162311MaRDI QIDQ4674499FDOQ4674499

Authors: Charles T. Retter 

Publication date: 11 May 2005

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

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

Recommendations

• The average binary weight-enumerator for a class of generalized Reed-Solomon codes
• On the Complete Weight Enumerator of Reed-Solomon Codes
• On the minimum average distance of binary constant weight codes
• scientific article; zbMATH DE number 1189005
• Average distance and minimum average distance of binary constant weight code and its properties
• scientific article; zbMATH DE number 4193605
• New explicit binary constant weight codes from Reed-Solomon codes
• Gaps in the binary weight distributions of Reed-Solomon codes
• An approximation to the weight distribution of binary linear codes
• A deterministic algorithm for the distance and weight distribution of binary nonlinear codes

Mathematics Subject Classification ID

Decoding (94B35)

Cited In (2)

• The average binary weight-enumerator for a class of generalized Reed-Solomon codes
• Title not available (Why is that?)

This page was built for publication: An average weight-distance enumerator for binary expansions of Reed-Solomon codes

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