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):
Displayed 6 items.
- The eigenstructure and Jordan form of the Fourier transform over fields of characteristic 2 and a generalized Vandermonde-type formula (Q252622) (← 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)
- A lookup table decoding of systematic \((47, 24, 11)\) quadratic residue code (Q2390373) (← links)
- High speed decoding of the binary \((47, 24, 11)\) quadratic residue code (Q2638202) (← links)