Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6

DOI10.1016/0166-218X(91)90110-IzbMath0736.94015OpenAlexW1967339335MaRDI QIDQ1180155

Arne Dür

Publication date: 27 June 1992

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

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90110-i

zbMATH Keywords

BCH codescovering radiusCauchy codesmaximum distance separable codesclassical invariant theoryRS codescomplete decodingsyndrome space

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15) Decoding (94B35) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The decoding of extended Reed-Solomon codes
• The automorphism groups of Reed-Solomon codes
• On linear MDS codes of length \(q+1\) over GF(q) for even q
• Note on cubics over \(GF(2^n)\) and \(GF(3^n)\)
• The invariant theory of binary forms
• On MDS extensions of generalized Reed- Solomon codes
• Gundelfinger's Theorem on Binary Forms
• Decoding of DBEC-TBED Reed-Solomon Codes
• A Construction Method of High-Speed Decoders Using ROM's for Bose–Chaudhuri–Hocquenghem and Reed–Solomon Codes
• Symmetries of binary Goppa codes (Corresp.)
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Some long cyclic linear binary codes are not so bad
• Adding Two Information Symbols to Certain Nonbinary BCH Codes and Some Applications
• Bounds for exponential sums

This page was built for publication: Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6