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 - Method to list all possible minimal polynomials for GF(2^n)
Author Message
gorzel
  Post subject:  Re: Method to list all possible minimal polynomials for GF(2^n)  Reply with quote
Take a look at the subdirectory gftables in the library folder
Singular/3-1-2/LIB/.

To see the Conway polynomials, you have to take a look at the
source code. Inspect the file
Singular-3-1-2/factoryConwayList.txt
Post Posted: Wed Mar 23, 2011 5:36 pm
gepo
  Post subject:  Method to list all possible minimal polynomials for GF(2^n)  Reply with quote
Hi,
I have searched the online manual of Singular while I failed to find a way to list all minimal polynomials for a Galois fieldGF(2^n).
Would you please point me a way to do that?

Thanks
Gepo
Post Posted: Wed Mar 23, 2011 7:05 am


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