The inverse cyclotomic Discrete Fourier Transform algorithm
arXiv:1809.09459 · doi:10.1109/LSP.2019.2929408
Abstract
The proof of the theorem concerning to the inverse cyclotomic Discrete Fourier Transform algorithm over finite field is provided.
arXiv comment4 pages. Proceedings of Sixteenth International Workshop on Algebraic and Combinatorial Coding Theory at Svetlogorsk, Russia, September 02-08, 2018
References in corpus (4)
- Composite Cyclotomic Fourier Transforms with Reduced Complexities
- Reduced-Complexity Reed--Solomon Decoders Based on Cyclotomic FFTs
- Reduced-Complexity Decoder of Long Reed-Solomon Codes Based on Composite Cyclotomic Fourier Transforms
- A novel method for computation of the discrete Fourier transform over characteristic two finite field of even extension degree