#8373: Construct finite fields with primitive defining polynomial
----------------------------------+------------------------
Reporter: rkirov | Owner: cpernet
Type: enhancement | Status: new
Priority: minor | Milestone: sage-6.4
Component: finite rings | Resolution:
Keywords: | Merged in:
Authors: Jeroen Demeyer | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #16927 | Stopgaps:
----------------------------------+------------------------
Comment (by pbruin):
Replying to [comment:13 jdemeyer]:
> Replying to [comment:11 pbruin]:
> > Some finite field implementations accept a string `modulus`, but this
should be obsolete
> Why should it be obsolete? I think the syntax
> {{{
> k.<a> = GF(p^n, modulus="primitive")
> }}}
> is very good to have.
Yes, it is certainly not this syntax that needs to be made obsolete!
> Note that the actual modulus polynomial is computed before the
implementation is even considered. So it's not that every finite field
implementation needs to be aware of this.
That is what I meant; the individual implementation should never need to
consider the case where `modulus` is a string, it should all be handled by
the factory.
--
Ticket URL: <http://trac.sagemath.org/ticket/8373#comment:15>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.