A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm

Authors:
S. V. Fedorenko
Affiliations:
Dept. of Distributed Comput. & Networking, St. Petersburg State Polytech. Univ., St. Petersburg
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 5

Complexity analysis of Reed-Solomon decoding over GF(2m) without using syndromes

EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
Simplified procedure for decoding nonsystematic reed-Solomon codes over GF(2m) using Euclid's algorithm and the fast Fourier transform

IEEE Transactions on Communications
Modified decoding of binary quadratic residue codes by using euclidean algorithm

ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
Efficient interpolation in the Guruswami-Sudan algorithm

IEEE Transactions on Information Theory
List decoding of generalized reed-solomon codes by using a modified extended key equation algorithm

EURASIP Journal on Wireless Communications and Networking

Quantified Score

Hi-index	754.90

Visualization

Abstract

A simple and natural Gao algorithm for decoding algebraic codes is described. Its relation to the Welch-Berlekamp and Euclidean algorithms is given