Fast algorithm for finding primitive polynomials over GF(q)
Di Porto, A.; Guida, F.; Montolivo, E.
Electronics Letters
Volume 28, Issue 2, 16 Jan. 1992 Page(s):118 - 120
Digital Object Identifier   10.1049/el:19920073
Summary:An efficient algorithm for the construction of primitive polynomials of degree m over GF(q) is proposed. The algorithm runs in time O(km²), where k is an integer such that gcd (k,q^m-1)=1.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.