暂无分享,去创建一个
The proof of the theorem concerning to the inverse cyclotomic Discrete Fourier Transform algorithm over finite field is provided.
[1] Martin Vetterli,et al. Computing m DFT's over GF(q) with one DFT over GF(qm) , 1993, IEEE Trans. Inf. Theory.
[2] Elena Costa,et al. On computing the syndrome polynomial in Reed-Solomon decoder , 2004, Eur. Trans. Telecommun..
[3] Peter Trifonov,et al. A Method for Fast Computation of the Fourier Transform over a Finite Field , 2003, Probl. Inf. Transm..