Computational Complexity of Fourier Transforms Over Finite Fields
From MaRDI portal
Arithmetic theory of polynomial rings over finite fields (11T55) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Convolution, factorization for one variable harmonic analysis (42A85) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Theory of error-correcting codes and error-detecting codes (94B99)
Cites work
- Algebraic coding theory
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Discrete Convolutions via Mersenne Transforms
- Fast multiplication of large numbers
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- Properties of the Sequence 3 ⋅2 n + 1
- The Fast Fourier Transform in a Finite Field
- The use of finite fields to compute convolutions
Cited in
(8)- Inverting a Vandermonde matrix in minimum parallel time
- Computational problems in the theory of finite fields
- Finding the intersection of two convex polyhedra
- Finite field towers: Iterated presentation and complexity of arithmetic.
- Authenticated hash tables based on cryptographic accumulators
- Discrete Weighted Transforms and Large-Integer Arithmetic
- The complexity of error-correcting codes
- A flow model based on polylinking system
This page was built for publication: Computational Complexity of Fourier Transforms Over Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4140387)
