Decoding of redundant residue polynomial codes using Euclid´s algorithm

A decoding method is proposed for the redundant residue polynomial codes, a class that includes Reed-Solomon codes. The method is based on properties of Euclid´s algorithm. The advantage of the method is that the computation of both the error-locator polynomial and the error-evaluator polynomial needed in conventional decoding methods can be avoided. The method is suitable for decoding concatenated codes whose outer codes are redundant residue polynomial codes, since they are easily decoded by ignoring erasures detected in the inner codes