Citation
Abstract
It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform (FFT) algorithm over finite fields GF(F,,), where F,, 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.
Details
- Volume
- 42-36
- Published
- December 15, 1976
- Pages
- 63–74
- File Size
- 929.6 KB