|P. S. Chakravarthi on Sun, 28 Nov 2004 05:44:05 +0100|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|on generation of primitive polynomials|
hi all. I'm a newbie to Pari/gp. Is there a way to generate all primitive polynomials over fields of the type GF(2^x) For example (01) + (10) x + (11) x^2 being primitive over GF(4) in GF(4^2) (i.e GF(16)) Please observe that this is _DIFFERENT_ from using GF(16) as GF(2^4) and asking for primitiveness of something like 1 + 1.x + 0.x^2 + 0.x^3 + 1. x^4 I do not seem to find a way. Actually I was suggested in sci.math.research group to use fxt software .. the author of which, in turn referred me to pari/gp Any help would be appreciated. I have pari/gp installed on my linux comp. cheers, chax. --I might not be the brightest bulb in the chandelier, but I'm pretty good at getting most of the other bulbs to light up.