Email this article Fast discrete Fourier transform on local fields of positive characteristic
- Authors: Lukomskii S.F.1, Vodolazov A.M.2
-
Affiliations:
- Department of Mathematical Analysis, Faculty of Mathematics and Mechanics
- Department of Computer Algebra and Number Theory, Faculty of Mathematics and Mechanics
- Issue: Vol 53, No 2 (2017)
- Pages: 155-163
- Section: Coding Theory
- URL: https://journal-vniispk.ru/0032-9460/article/view/166382
- DOI: https://doi.org/10.1134/S0032946017020041
- ID: 166382
Cite item
Open Access
Access granted
Subscription Access
Abstract
For the discrete Fourier transform with respect to the system of characters of a local field with positive characteristic, we propose a fast algorithm. We find the complexity of the algorithm.
About the authors
S. F. Lukomskii
Department of Mathematical Analysis, Faculty of Mathematics and Mechanics
Author for correspondence.
Email: LukomskiiSF@info.sgu.ru
Russian Federation, Saratov
A. M. Vodolazov
Department of Computer Algebra and Number Theory, Faculty of Mathematics and Mechanics
Email: LukomskiiSF@info.sgu.ru
Russian Federation, Saratov
Supplementary files
