Semi-Fast Fourier Transforms over GF(2m).

DOI10.1109/TC.1978.1675088MaRDI QIDQ4147589zbMATH OpenFDO

Authors Dilip V. Sarwate

Publication date 1978

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1978.1675088

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(1)

• Polynomial evaluation over finite fields: new algorithms and complexity bounds

This page was built for publication: Semi-Fast Fourier Transforms over GF(2^m).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4147589)