DocumentCode :
927830
Title :
The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions
Author :
Reed, Irving S. ; Scholtz, Robert A. ; Truong, T.K. ; Welch, Lloyd R.
Volume :
24
Issue :
1
fYear :
1978
fDate :
1/1/1978 12:00:00 AM
Firstpage :
100
Lastpage :
106
Abstract :
It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform (FFT) algorithm over finite fields 
, where 
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.
, where 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.Keywords :
Continued fractions; Galois fields; Number-theoretic transforms; Reed-Solomon codes; Arithmetic; Code standards; Convolutional codes; Decoding; Fast Fourier transforms; Galois fields; Hardware; Reed-Solomon codes; Software algorithms; Software standards;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1978.1055816
Filename :
1055816
Link To Document :
