Error control systems for digital communication and storage
Error control systems for digital communication and storage
The U.S. HDTV standard—the grand alliance
IEEE Spectrum
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Reed-Solomon Codes and Their Applications
Reed-Solomon Codes and Their Applications
Theory of Information and Coding
Theory of Information and Coding
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
A Method for Fast Computation of the Fourier Transform over a Finite Field
Problems of Information Transmission
Fast, prime factor, discrete Fourier transform algorithms over GF(2m) for 8≤m≤10
Information Sciences: an International Journal
A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm
IEEE Transactions on Information Theory
IEEE Communications Magazine
Hi-index | 0.00 |
Gao's algorithm similar to Shiozaki's algorithm for decoding nonsystematic Reed-Solomon (RS) codes which is a subclass of the redundant residue polynomial codes is considered here. This algorithm computes the message polynomial directly without explicitly finding the error-locator polynomial and error-evaluator polynomial. In this letter, a simplified decoding algorithm to correct both errors and erasures is used in conjunction with Gao's algorithm for efficiently decoding RS codes. In addition, we show that the extended Gao algorithm similar to the Shiozaki-Truong-Cheung-Reed algorithm significantly reduces the decoding complexity.