| Thanks to Malcolm Greig, here is a table of primitive polynomials for building GF(pn) for all pn up to 230, with n > 1.
I have translated this
table
in Maple format through a characteristic by characteristic index.
The uncompressived file is about 133Kb in size.
Only one primitive polynomial is given for each order.
This table was used in generating combinatorial designs,
but doubtless has other uses.
The theory used in compiling the table was taken from:
J. D. Alanen and D. E. Knuth, Tables of finite fields, Sankhya A (1964) 26, 305-328.
The file is in fixed format (actually (I10,I7,I3,30I6) for those who remember FORTRAN).
The fields are v,p,n,bn-1,bn-2,...,b0 and are ordered within the file
by p, then n within p, where v=pn. Each pn is on a separate line.
The primitive polynomial is
f(x)=xn+bn-1xn-1+bn-2xn-2+...+b0
The leading term xn is implicit. This polynomial has the property that the successive powers
of any one of the roots of f(x)=0 generate GF(pn).
Also, if n is even, then successive powers of b0 generate GF(p),
whilst if n is odd, then successive powers of p-b0 generate GF(p).
I no longer remember precisely what criteria I used in selecting the polynomial;
I do remember it was similar to Alanen and Knuth's criteria, but was not identical.
It does have the property that most coefficients are zero, and those that
are non-zero tend to be ones (except b0, of course).
|
|
Malcolm Greig
|
|
