Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials

DOI10.1109/18.391235MaRDI QIDQ4857490zbMATH OpenOpenAlexFDO

Authors Dariush Dabiri, Ian Blake

Publication date 15 April 1996

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

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

zbMATH Keywords

decoding of Reed-Solomon codessystolic arraysWelch-Berlekamp equation

Mathematics Subject Classification ID

Distributed algorithms (68W15) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Cyclic codes (94B15) Decoding (94B35)

Recommendations

• Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes
• Parallel decoding of the Reed-Solomon codes
• scientific article; zbMATH DE number 4008275
• scientific article; zbMATH DE number 57521
• A new Reed-Solomon code decoding algorithm based on Newton's interpolation

Cited in

(7)

• Homogeneous interpolation problem and key equation for decoding Reed- Solomon codes
• Parallel decoding of the Reed-Solomon codes
• Decoding of redundant residue polynomial codes using Euclid's algorithm
• Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes
• Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders
• A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
• Fast Encoding Algorithms for Reed–Solomon Codes With Between Four and Seven Parity Symbols

This page was built for publication: Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials

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