Additive fast Fourier transforms over finite fields.

View Researcher's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Please contact us in case of a broken link from here

Authors Shuhong Gao, Todd Mateer
Journal/Conference Name IEEE Transactions on Information Theory
Paper Category
Paper Abstract We present new additive Fast Fourier Transform (FFT) algorithms based on Taylor expansions over finite fields of characteristic two. The new algorithms improve previous approaches by Wang and Zhu (1988), Cantor (1989), and von zur Gathen and Gerhard (1996).
Date of publication 2010
Code Programming Language C
Comment

Copyright Researcher 2022