Fast Transform for Decoding Both Errors and Erasures of Reed-Solomon Codes Over GF for
Trieu‐Kien Truong, Pin-Han Chen, L. J. Wang, Taikun Cheng · 2006
In this letter, it is shown that a fast, prime-factor dis- crete Fourier transform (DFT) algorithm can be modified to com- pute Fourier-like transforms of long sequences of points over GF , where . Using these transforms, to- gether with the Berlekamp-Massey algorithm, the complexity of the transform-domain decoder for correcting both errors and era- sures of the Reed-Solomon codes of block length over GF for is reduced substantially from the pre- vious time-domain decoder. A computer simulation verifies these new results.