Geodesic
Some properties of the discrete Fourier transform in the field of complex numbers and in the fields of finite characteristics
Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 7-9 
A. M. Grishin. Some properties of the discrete Fourier transform in the field of complex numbers and in the fields of finite characteristics. Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 7-9. http://geodesic.mathdoc.fr/item/PDM_2010_12_a1/
@article{PDM_2010_12_a1,
     author = {A. M. Grishin},
     title = {Some properties of the discrete {Fourier} transform in the field of complex numbers and in the fields of finite characteristics},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {7--9},
     year = {2010},
     number = {12},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2010_12_a1/}
}
TY  - JOUR
AU  - A. M. Grishin
TI  - Some properties of the discrete Fourier transform in the field of complex numbers and in the fields of finite characteristics
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2010
SP  - 7
EP  - 9
IS  - 12
UR  - http://geodesic.mathdoc.fr/item/PDM_2010_12_a1/
LA  - ru
ID  - PDM_2010_12_a1
ER  - 
%0 Journal Article
%A A. M. Grishin
%T Some properties of the discrete Fourier transform in the field of complex numbers and in the fields of finite characteristics
%J Prikladnaâ diskretnaâ matematika
%D 2010
%P 7-9
%N 12
%U http://geodesic.mathdoc.fr/item/PDM_2010_12_a1/
%G ru
%F PDM_2010_12_a1

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider the discrete Fourier transform over the field of complex numbers $C$ and over the Galois field $\mathrm{GF}(q)$. The length $N$ of a given vector over $C$ can be any positive integer, and in the Galois field $N$ is multiple to $(q-1)$. This imposes certain restrictions on possibilities for constructing Fast Fourier Algorithms in Galois fields and increases the dimension of input data.

[1] Glukhov M. M., Elizarov V. P., Nechaev A. A., Algebra, v. 1, 2, GeliosARV, M., 2003

[2] Yaroslavskii L. P., Merzlyakov N. S., Metody tsifrovoi golografii, Nauka, M., 1977

[3] Fomichev V. M., Metody diskretnoi matematiki v kriptologii, Dialog-MIFI, M., 2010

[4] Oppengeim A., Shafer R., Tsifrovaya obrabotka signalov, Tekhnosfera, M., 2009

[5] Solonina A. I., Ulakhovich D. A., Arbuzov S. M., Soloveva E. B., Osnovy tsifrovoi obrabotki signalov, 2-e izd., BKhV-Peterburg, SPb., 2006

[6] Cheremushkin A. V., Lektsii po arifmeticheskim algoritmam v kriptografii, MTsNMO, M., 2002

[7] http://psi-logic.shadanakar.org/fft/fft.htm