Simplified algorithm for correcting both errors and erasures of Reed-Solomon codes
I.S. Reed, T. K. Truong, Robert Miller · Proceedings of the Institution of Electrical Engineers · 1979
Using a finite-field transform, a simplified algorithm for decoding Reed-Solomon codes is developed to correct erasures as well as errors over the finite-field GF(qm), where q is a prime and m is an integer. If the finite-field transform is a fast transform, this decoder can be faster and simpler than a decoder that uses more conventional methods.