Answers are grounded in this paper and cite their sources.
It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform (FFT) algorithm over finite fieldsGF(Fₙ), whereFₙis a Fermat prime, and continued fractions. This new transform decoding method is simpler than the standard method for RS codes. The computing time of this new decoding algorithm in software can be faster than the standard decoding method for RS codes.
No takes yet. Share an insight, caveat, or question.
Reed et al. (1978) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: