DocumentCode :
1164848
Title :
Fast algorithm for finding primitive polynomials over GF(q)
Author :
Di Porto, A. ; Guida, F. ; Montolivo, E.
Author_Institution :
Fondazione Ugo Bordoni, Rome, Italy
Volume :
28
Issue :
2
fYear :
1992
Firstpage :
118
Lastpage :
120
Abstract :
An efficient algorithm for the construction of primitive polynomials of degree m over GF(q) is proposed. The algorithm runs in time O(km2), where k is an integer such that gcd (k,qm-1)=1.
Keywords :
information theory; polynomials; fast algorithm; primitive polynomials;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19920073
Filename :
118917
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1164848
بازگشت