Erratum to "Fast, prime factor, discrete Fourier transform algorithms over GF(2m) for 8 ≤ m ≤ 10" [Informat. Sci. 176 (1) (2006) 1-26] (DOI:10.1016/j.ins.2004.10.001);Fast, prime factor, discrete Fourier transform algorithms over GF(2 m) for 8 ≤ m ≤ 10

Information Sciences

Volumn 176, Issue 1, 2006, Pages 1-26

  Truong, T K ^a   Chen, P D ^a   Wang, L J ^b   Chang, Y ^a   Reed, I S ^c  

^a I SHOU UNIVERSITY   (Taiwan)

^b NATIONAL PINGTUNG UNIVERSITY   (Taiwan)

^c University of Southern California ^*  (United States)

Author keywords

Cyclic convolution; Prime factor DFT algorithm; Reed Solomon codes; Winograd's algorithm

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL METHODS; COMPUTER SIMULATION; DISCRETE FOURIER TRANSFORMS;

CYCLIC CONVOLUTION; PRIME FACTOR DFT ALGORITHMS; REED-SOLOMAN CODES; WINOGRAD'S ALGORITHMS;

ALGORITHMS;

EID: 25644435499     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2006.04.007     Document Type: Erratum

References (19)

1. C.M. Rader Discrete Fourier transform when the number of data samples is prime Proc. IEEE 56 6 1968 1107 1108
2. S. Winograd On computing the discrete Fourier transform Math. Comput. 32 141 1978 175 199
3. R.C. Agarwal, and J.W. Cooley New algorithms for digital convolution IEEE Trans. Acoust., Speech, Signal Process. ASSP-25 5 1977 392 409
4. D.P. Kolba, and T.K. Park A prime factor FFT algorithm using high-speed convolution IEEE Trans. Acoust., Speech, Signal Process. ASSP-25 4 1977 281 294
5. E.R. Berlekamp Algebraic Coding Theory 1968 Mcgraw-Hall New York
6. m) for m = 4, 5, 6, 8, Deep Space Network Progress Report 42-50, Jet Propulsion Laboratory, Pasadena, California, January 1979, pp. 132-154.
7. I.S. Reed, T.K. Truong, R.L. Miller, and J.P. Huang Fast transforms for decoding Reed-Solomon codes IEE Proc. 128, pt. F 1 1981 9 14
8. T.K. Truong, J.H. Jeng, and I.S. Reed Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders IEEE Trans. Commun. 49 5 2001 779 783
9. S.V. Fedorenko, and P.V. Trifonov Finding roots of polynomials over finite fields IEEE Trans. Commun. 50 11 2002 1709 1711
10. P.V. Trifonov, and S.V. Fedorenko A method for fast computation of the Fourier transform over a finite field Problem Inform. Transm. 39 3 2003 231 238
11. S.B. Wicker, and V.K. Bhargava Reed-Solomon Codes and their Application 1994 IEEE Press New York
12. R.E. Blahut Theory and Practice of Error Control Codes 1983 Addison-Wesley Reading, Massachusetts
13. Y. Wang, and X. Zhu A fast algorithm for the Fourier transform over finite fields and its VLSI implementation IEEE J. Select. Areas Commun. 6 3 1988 572 577
14. T.G. Zakharova Fourier transform evaluation in fields of characteristic 2 Problem Inform. Transm. 28 2 1992 154 167
15. m), in: Pomekhoustoichivoe kodirovanie i nadezhnost' EVM (Error-Resistant Coding and Reliability of Computers), Nauka, Moscow, 1987, pp. 33-55.
16. E.M. Gabidulin, and V.B. Afanasyev Kodirovanie v radioelektronike (Coding in Radio Electronics) 1986 Radio I Svyaz' Moscow
17. E.O. Brigham The Fast Fourier Transform and its Applications 1988 Prentice-Hall, Inc Englewood Cliffs, NJ
18. 8) with both errors and erasures using transform decoding IEE Proc. 127, pt. E 10 1980 136 142
19. R. Lidl, and H. Niederreiter Introduction to Finite Fields and Their Applications 1986 Cambridge University Press