A new Reed-Solomon code decoding algorithm based on Newton's interpolation

DOI10.1109/18.212267MaRDI QIDQ4202054zbMATH OpenOpenAlexFDO

Authors Ulrich Sorger

Publication date 12 October 1993

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

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

zbMATH Keywords

Berlekamp-Massey algorithmfast generalized-minimum-distance decodingNewton's interpolationReed- Solomon code decoding algorithmsoft-decision decoding

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Recommendations

• A New Algorithm for Decoding Reed-Solomon Codes
• Algebraic soft-decision decoding of reed-solomon codes
• A complexity-reduced interpolation algorithm for soft-decision decoding of Reed-Solomon codes
• A Decoding Approach to Reed–Solomon Codes from Their Definition
• Two new decoding algorithms for Reed-Solomon codes

Cited in

(9)

• On multi-trial Forney-Kovalev decoding of concatenated codes
• A complexity-reduced interpolation algorithm for soft-decision decoding of Reed-Solomon codes
• Le Decodage Rapide Des Codes De Reed-Solomon Et Leur Generalisation
• Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
• Multitrial decoding of concatenated codes using fixed thresholds
• Modified time-domain algorithm for decoding Reed-Solomon codes
• Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences
• Using Lagrange's interpolation formula to construct Reed-Solomon codes over GF(p)
• Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials

This page was built for publication: A new Reed-Solomon code decoding algorithm based on Newton's interpolation

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