Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm

DOI10.1109/TIT.2007.901169MaRDI QIDQ3548258zbMATH OpenFDO

Authors Jørn Justesen

Publication date 21 December 2008

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

Mathematics Subject Classification ID

Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• Bounded distance+1 soft-decision Reed-Solomon decoding
• Decoding of Reed Solomon codes beyond the error-correction bound
• An efficient soft-decision Reed-Solomon decoding algorithm
• Decoding of Reed-Muller codes with a large number of errors
• Algebraic soft-decision decoding of reed-solomon codes

Cited in

(2)

• On Koetter's algorithm and the computation of error values
• Towards a VLSI architecture for interpolation-based soft-decision Reed-Solomon decoders

This page was built for publication: Upper Bounds on the Number of Errors Corrected by the Koetter–Vardy Algorithm

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