Simplified procedure for decoding nonsystematic reed-solomon codes over gf(2 m ) using euclid's algorithm and the fast fourier transform

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 errorevaluator 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.