Multiplicative characters and the discrete Fourier transform
From MaRDI portal
The paper is concerned with an analysis of multiplicative complexity of the discrete Fourier transform from a number theoretic point of view. Results from a paper of \textit{L. Auslander}, \textit{E. Feig} and \textit{S. Winograd} [Adv. Appl. Math. 5, 31-55 (1984; Zbl 0568.65095)] are reproved using the multiplicative characters theory.
Recommendations
- The multiplicative complexity of the discrete Fourier transform
- Dirichlet characters, Gauss sums and arithmetic Fourier transforms
- Fourier transforms of multiplicative convolutions
- scientific article; zbMATH DE number 3248989
- Multiplicative Fourier transform
- scientific article; zbMATH DE number 854337
- Publication:4502651
- scientific article; zbMATH DE number 3869640
- Some properties of the discrete Fourier transform in the field of complex numbers and in the fields of finite characteristics
- Generalization of the multiplicative Fourier transform and its properties
Cites work
This page was built for publication: Multiplicative characters and the discrete Fourier transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1819920)