The following pages link to (Q3258578):
Displaying 36 items.
- Improved recovery guarantees for phase retrieval from coded diffraction patterns (Q347510) (← links)
- Rotator design (Q585173) (← links)
- Eigenspaces of the discrete Walsh transform (Q764071) (← links)
- Discrete Chrestenson transform (Q764089) (← links)
- Self-sorting mixed-radix fast Fourier transforms (Q1050756) (← links)
- A note on prime factor FFT algorithms (Q1050757) (← links)
- Gauss and the history of the fast Fourier transform (Q1065775) (← links)
- Implementation of a self-sorting in-place prime factor FFT algorithm (Q1087005) (← links)
- A self-sorting in-place prime factor real/half-complex FFT algorithm (Q1097677) (← links)
- Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms (Q1103363) (← links)
- An algorithm for gene frequency changes for linked autosomal loci based on genetic algebras (Q1160581) (← links)
- Redundancy techniques and fast algorithms for a special large linear system (Q1241255) (← links)
- FFT bifurcation analysis of routes to chaos via quasiperiodic solutions (Q1665482) (← links)
- Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations (Q1823640) (← links)
- Nesting strategies for prime factor FFT algorithms (Q1825020) (← links)
- Fast decoding of non-binary first order Reed-Muller codes (Q1919701) (← links)
- Triangular systems for symmetric binary variables (Q1952009) (← links)
- Characteristic vector and weight distribution of a linear code (Q2040349) (← links)
- Fourier matrices and Fourier tensors (Q2239350) (← links)
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings (Q2274408) (← links)
- New Good's type Kronecker power expansions (Q2314156) (← links)
- Fully homomorphic SIMD operations (Q2439746) (← links)
- Algebraic theory of finite Fourier transforms (Q2547695) (← links)
- Integer multiplication in time \(O(n\log n)\) (Q2662018) (← links)
- Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme (Q3104682) (← links)
- Efficient Computation of the Fourier Transform on Finite Groups (Q3493168) (← links)
- On Computing the Discrete Fourier Transform (Q4151723) (← links)
- Points of constancy of the periodic linearized Korteweg–deVries equation (Q4626128) (← links)
- Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949) (← links)
- Construction of Binary Bent Functions by FFT-Like Permutation Algorithms (Q5157441) (← links)
- The differential Fourier transform method (Q5269166) (← links)
- Irregular primes to two billion (Q5270847) (← links)
- An Algorithm for the Machine Calculation of Complex Fourier Series (Q5332499) (← links)
- Roundoff Error Analysis of the Fast Fourier Transform (Q5634823) (← links)
- Generalization of the fast Fourier transform with a constant structure (Q6077988) (← links)
- The secret life of I. J. Good (Q6111473) (← links)
