The decoding of extended Reed-Solomon codes

DOI10.1016/0012-365X(91)90093-HzbMath0726.94010MaRDI QIDQ803107

Arne Dür

Publication date: 1991

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

covering radiusReed-Solomon codesmaximum distance separable codesBerlekamp's decoding algorithmdecoding problem for Cauchy codes

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Related Items

Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6, Some results on deep holes of generalized projective Reed-Solomon codes, On the covering radius of Reed-Solomon codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The automorphism groups of Reed-Solomon codes
• On linear MDS codes of length \(q+1\) over GF(q) for even q
• Equations over finite fields. An elementary approach
• The invariant theory of binary forms
• Covering radius---Survey and recent results
• On generator matrices of MDS codes (Corresp.)
• On MDS extensions of generalized Reed- Solomon codes
• Gundelfinger's Theorem on Binary Forms
• High-speed decoding of BCH codes (Corresp.)
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• On decoding BCH codes
• Adding Two Information Symbols to Certain Nonbinary BCH Codes and Some Applications