Pages that link to "Item:Q2487094"
From MaRDI portal
The following pages link to A method for fast computation of the Fourier transform over a finite field (Q2487094):
Displaying 3 items.
- Simple algorithms for decoding systematic Reed-Solomon codes (Q356717) (← links)
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) (Q2575622) (← links)
- Reducing the number of operations in certain finite- field transforms (Corresp.) (Q3329388) (← links)