By Topic

Fast Algorithm for Computing the Minimal Polynomials of Gaussian Periods

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
He Debiao ; Sch. of Math. & Stat., Whan Univ., Wuhan, China ; Chen Jianhua ; Hu Zhjin

Gaussian Periods, the basis of the theory of compass and straightedge construction, introduced by Gauss, play an important role in the history of mathematics. An efficient way of computing minimal polynomials of Gaussian Periods is proposed. Compared with other methods, the method which is much simpler and much easier to be implemented can avoid approximate computation because its progress is completed in rational integer ring.

Published in:

Computational Intelligence and Design, 2009. ISCID '09. Second International Symposium on  (Volume:1 )

Date of Conference:

12-14 Dec. 2009