Abstract
Schemes are developed whereby the number of arithmetic operations needed in a fast finite field transform employing factor-type algorithms are decreased by using a chord property of the intermediate variables. Noticeable improvements in both the Good and the Cooley-Tukey forms of fast algorithms are possible. A proof of the limited chord properties of the intermediate variable is included, and several numerical examples for comparison purposes are given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
