Back to Forum | View unanswered posts | View active topics





Post a reply
Username:
Note:If not registered, provide any username. For more comfort, register here.
Subject:
Message body:
Enter your message here, it may contain no more than 60000 characters. 

Smilies
:D :) :( :o :shock: :? 8) :lol: :x :P :oops: :cry: :evil: :twisted: :roll: :wink: :!: :?: :idea: :arrow: :| :mrgreen:
Font size:
Font colour
Options:
BBCode is ON
[img] is ON
[flash] is OFF
[url] is ON
Smilies are ON
Disable BBCode
Disable smilies
Do not automatically parse URLs
Confirmation of post
To prevent automated posts the board requires you to enter a confirmation code. The code is displayed in the image you should see below. If you are visually impaired or cannot otherwise read this code please contact the %sBoard Administrator%s.
Confirmation code:
Enter the code exactly as it appears. All letters are case insensitive, there is no zero.
   

Topic review - how to quickly find ONE primitive polynomial in GF(2^m)
Author Message
gorzel
  Post subject:  Re: how to quickly find ONE primitive polynomial in GF(2^m)  Reply with quote
gepo wrote:
Hi,
How to quickly find ONE primitive polynomial in GF(2^m) with "m" up to 2048 ?
I have searched for a while but failed to find such a function.

Thanks
Gepo


Supposed you mean: GF(2^m) with 2^m<= 2048 (and not m<=2048)
you can define in Singular theses Galois fields and then display the minimal polynomial.

Code:
ring r2048 = (2^11,a),x,dp;
minpoly;


It is unlikly that an explicit function for the minpolys exist. But on
Frank Luebeck's website you find lists of primitive polynomials and
two methods how to compute the Conway polynomials:

http://www.math.rwth-aachen.de/~Frank.L ... index.html


C. Gorzel
Post Posted: Mon May 03, 2010 6:42 pm
gepo
  Post subject:  how to quickly find ONE primitive polynomial in GF(2^m)  Reply with quote
Hi,
How to quickly find ONE primitive polynomial in GF(2^m) with "m" up to 2048 ?
I have searched for a while but failed to find such a function.

Thanks
Gepo
Post Posted: Fri Apr 30, 2010 3:45 am


It is currently Fri May 13, 2022 11:06 am
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group