NASA NTRS · 19780042412
The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions
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 sub n), where F sub n 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.
Keep this discovery
Explore connections, maps & timelines
Reed, I. S., Scholtz, R. A., Welch, L. R., Truong, T. K.. 1978-01-01. The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions. https://ntrs.nasa.gov/citations/19780042412
Cite the original work for its findings. Save a collection to share your selection of sources.