02194890

j

02194890 Trifonov, P.V. Fedorenko, S.V. A method for fast computation of the Fourier transform over a finite field. Probl. Inf. Transm. 39, No. 3, 231-238 (2003); translation from Prob. Peredachi Inf. 39, No. 3, 3-10 (2003). 2003 MAIK Nauka/Interperiodica Publishing, Moscow; Springer, New York, NY EN fast Fourier transform numerical examples fast computation

doi:10.1023/A:1026171930630

Summary: 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.