论文信息 - A simple algorithm for decoding both errors and erasures of Reed-Solomon codes - 字舞流文

A simple algorithm for decoding both errors and erasures of Reed-Solomon codes

A simple algorithm for decoding both errors and erasures of Reed-Solomon codes is described.

Sergei V. Fedorenko

[1] Akira Shiozaki. Decoding of redundant residue polynomial codes using Euclid's algorithm , 1988, IEEE Trans. Inf. Theory.

[2] Sergei V. Fedorenko. Correction to "A Simple Algorithm for Decoding Reed-Solomon Codes and Its Relation to the Welch-Berlekamp Algorithm" , 2006, IEEE Trans. Inf. Theory.

[3] Shuhong Gao,et al. A New Algorithm for Decoding Reed-Solomon Codes , 2003 .

[4] Sergei V. Fedorenko. A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm , 2005, IEEE Transactions on Information Theory.

[5] Richard E. Blahut. Algebraic Codes on Lines, Planes, and Curves: An Engineering Approach , 2008 .

[6] Tsung-Ching Lin,et al. Simplified procedure for decoding nonsystematic reed-solomon codes over gf(2m) using euclid's algorithm and the fast fourier transform , 2009, IEEE Transactions on Communications.

[7] Richard E. Blahut,et al. Algebraic Codes on Lines, Planes, and Curves: Sequences and the One-Dimensional Fourier Transform , 2008 .