Title :
Fourier transform algorithm for a prime number blocklength Reed-Solomon code can be computationally efficient
Author :
Stasinski, Ryszard
Author_Institution :
Dept. of Telecom., Inst. of Technol., Trondheim
fDate :
27 Jun-1 Jul 1994
Abstract :
In the paper efficient computation of used in Reed-Solomon code decoders p-point discrete Fourier transforms (DFTs) in finite fields for p being a prime number is considered
Keywords :
Galois fields; Reed-Solomon codes; discrete Fourier transforms; DFT; Fourier transform algorithm; Galois fields; Reed-Solomon code; Reed-Solomon code decoders; computational efficiency; discrete Fourier transforms; finite fields; prime number blocklength; Convolution; Decoding; Discrete Fourier transforms; Fourier transforms; Galois fields; Multidimensional systems; Paper technology; Reed-Solomon codes; Signal processing algorithms; Telecommunication computing;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394852
