|
Problemy Peredachi Informatsii, 2003, Volume 39, Issue 3, Pages 3–10
(Mi ppi304)
|
|
|
|
This article is cited in 53 scientific papers (total in 53 papers)
Information Theory and Coding Theory
Method for the Fast Fourier Transform Evaluation
over a Finite Field
P. V. Trifonov, S. V. Fedorenko Saint-Petersburg State Polytechnical University
Abstract:
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.
Received: 25.10.2002 Revised: 05.02.2003
Citation:
P. V. Trifonov, S. V. Fedorenko, “Method for the Fast Fourier Transform Evaluation
over a Finite Field”, Probl. Peredachi Inf., 39:3 (2003), 3–10; Problems Inform. Transmission, 39:3 (2003), 231–238
Linking options:
https://www.mathnet.ru/eng/ppi304 https://www.mathnet.ru/eng/ppi/v39/i3/p3
|
Statistics & downloads: |
Abstract page: | 1100 | Full-text PDF : | 380 | References: | 66 |
|