Menu: Home :: go to Journal :: switch to Russian :: switch to English
You are here: all Journals and Issues→ Journal→ Issue→ Article

About computation of multidimentional Discrete Fourier Transform in a finite field

Annotation

The method of computation of descrete Fourier transform for polynomials of many variables over the ring Zp[x1, x2, … , xn] is considered. Theoretical complexity of the stated approach is provided.

Keywords

computer algebra; descrete Fourier transform; fast Fourier transform; theory of algorithms

Full-text in one file

Download

UDC

519.688

Pages

729-731

Section of issue

Articles

Для корректной работы сайта используйте один из современных браузеров. Например, Firefox 55, Chrome 60 или более новые.