论文信息 - A Method for Fast Computation of the Fourier Transform over a Finite Field

A Method for Fast Computation of the Fourier Transform over a Finite Field

We consider the problem of fast computation of the Fourier transform over a finite field by decomposing an arbitrary polynomial into a sum of linearized polynomials. Examples of algorithms for the Fourier transform with complexity less than that of the best known analogs are given.

Peter Trifonov | Sergei V. Fedorenko

[1] R. Blahut. Theory and practice of error control codes , 1983 .

[2] Trieu-Kien Truong,et al. Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders , 2001, IEEE Trans. Commun..

[3] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[4] Paul M. Embree,et al. C++ algorithms for digital signal processing , 1998 .

[5] Peter Trifonov,et al. Finding roots of polynomials over finite fields , 2002, IEEE Trans. Commun..

[6] Richard C. Singleton,et al. On computing the fast Fourier transform , 1967, Commun. ACM.

[7] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[8] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[9] Richard E. Blahut,et al. Fast Algorithms for Digital Signal Processing , 1985 .

[10] Allan O. Steinhardt,et al. Fast algorithms for digital signal processing , 1986, Proceedings of the IEEE.

[11] Yao Wang,et al. A fast algorithm for the Fourier transform over finite fields and its VLSI implementation , 1988, IEEE J. Sel. Areas Commun..

[12] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .