NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractionsIt 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.
Document ID
19780042412
Document Type
Reprint (Version printed in journal)
Authors
Reed, I. S. (University of Southern California Los Angeles, CA, United States)
Scholtz, R. A. (University of Southern California Los Angeles, CA, United States)
Welch, L. R. (Southern California, University Los Angeles, Calif., United States)
Truong, T. K. (California Institute of Technology, Jet Propulsion Laboratory, Pasadena Calif., United States)
Date Acquired
August 9, 2013
Publication Date
January 1, 1978
Publication Information
Publication: IEEE Transactions on Information Theory
Volume: IT-24
Subject Category
CYBERNETICS
Funding Number(s)
CONTRACT_GRANT: NAS7-100
CONTRACT_GRANT: DAAG29-76-G-0246
CONTRACT_GRANT: AF-AFOSR-75-2798
Distribution Limits
Public
Copyright
Other