Fast transforms for decoding Reed-Solomon codes
In the paper it is shown that the Chinese remainder theorem when coupled with a modification of Winograd's method can be used to compute Fourier-like transforms over GF (s super m), where m = 2, 3, . . . , 8. These new transform techniques are to decode Reed-Solomon codes of block length 2 super m -1. The results are shown to be more efficient than the more conventional method.
Reed, I. S.↗