Exploiting the cannibalistic traits of Reed-Solomon codes

DOI10.1109/26.481220MaRDI QIDQ2726172zbMATH OpenOpenAlexFDO

Authors Oliver Collins

Publication date 7 February 2002

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/1c999bdb395bb9fca3080c066381f1c0da601bec, http://hdl.handle.net/2060/19940009905

zbMATH Keywords

encoder and decoder complexitieslong Reed-Solomon codes

Mathematics Subject Classification ID

Other types of codes (94B60)

Recommendations

• scientific article; zbMATH DE number 1026591
• On the complexity of decoding Reed-Solomon codes (Corresp.)
• On Reed-Solomon codes
• Advances in the performance of Reed-Solomon codes
• On Expanded Cyclic and Reed–Solomon Codes
• Efficient decoding of Reed-Solomon codes beyond half the minimum distance
• Decoding of Reed Solomon codes beyond the error-correction bound
• The decoding of extended Reed-Solomon codes
• Successive cancellation decoding of Reed-Solomon codes
• Decoding Reed-Solomon codes beyond half the minimum distance

This page was built for publication: Exploiting the cannibalistic traits of Reed-Solomon codes

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