Pages that link to "Item:Q2575622"
From MaRDI portal
The following pages link to Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) (Q2575622):
Displaying 16 items.
- The eigenstructure and Jordan form of the Fourier transform over fields of characteristic 2 and a generalized Vandermonde-type formula (Q252622) (← links)
- A method for computation of the discrete Fourier transform over a finite field (Q415656) (← links)
- Fast Fourier transform using matrix decomposition (Q508808) (← links)
- Cyclic codes over \(R = F_p + uF_p + \cdots + u^{k - 1}F_p\) with length \(p^sn\) (Q632794) (← links)
- Algebraic decoding of the \((41, 21, 9)\) quadratic residue code (Q730938) (← links)
- Fast discrete Fourier transform computations using the reduced adder graph technique (Q838581) (← links)
- Efficient matched filters for DFT based codes (Q994217) (← links)
- Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms (Q1812878) (← links)
- A lookup table decoding of systematic \((47, 24, 11)\) quadratic residue code (Q2390373) (← links)
- Hardware efficient fast computation of the discrete Fourier transform (Q2432132) (← links)
- High speed decoding of the binary \((47, 24, 11)\) quadratic residue code (Q2638202) (← links)
- Fast DFT algorithms for length \(N=q*2^m\) (Q2724302) (← links)
- Recognition of RS coding based on Galois field Fourier transform (Q2990993) (← links)
- A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $ (Q3992213) (← links)
- Computing m DFTs over GF(q) with one DFT over GF(q/sup m/) (Q4034468) (← links)
- Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed--Solomon codes (Q4633757) (← links)
