Answers are grounded in this paper and cite their sources.
It is shown that√\[8]{2}is an element of order2ⁿ⁺⁴inGF(Fₙ), whereFₙ=2^{2ⁿ}+1is a Fermat prime forn=3,4. Hence it can be used to define a fast Fourier transform (FFT) of as many as2ⁿ⁺⁴symbols inGF(Fₙ). Since√[8]{2}is a root of unity of order2ⁿ⁺⁴inGF(Fₙ), this transform requires fewer muitiplications than the conventional FFT algorithm. Moreover, as Justesen points out [1], such an FFT can be used to decode certain Reed-Solomon codes. An example of such a transform decoder for the casen=2, where√2is inGF(F₂)=GF(17), is given.
No takes yet. Share an insight, caveat, or question.
Reed et al. (1978) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: