Fast Error and Erasure Decoding Algorithm for Reed-Solomon Codes

Reed-Solomon (RS) codes are widely used to correcter rors and erasures. This letter proposes a fast error and erasurede coding algorithm for RS codes. It achieves the best-known complexity O(nlog(n-k)+(n-k) log(2)(n-k)), wheren, kare the code length and dimension, respectively. Furthermore, the proposed method is efficient for practical codes. For decoding RS(255,223), compared with the existing method, the newalgorith m saves32%field operations