#14833: Make choosing irreducible polynomials independent of finite field
implementations
----------------------------+-----------------------------------------------
Reporter: pbruin | Owner: cpernet
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.12
Component: finite rings | Keywords: polynomials
Work issues: | Report Upstream: N/A
Reviewers: | Authors: Peter Bruin
Merged in: | Dependencies: #14832
Stopgaps: |
----------------------------+-----------------------------------------------
This patch makes the `FiniteField` constructor call the implementation-
independent code for choosing irreducible polynomials from #14832.
With this patch, the generic constructor always passes an actual
polynomial (not a string specifiying an algorithm to construct one) to the
finite field implementation class. For backwards compatibility, the
existing classes still recognise a string `modulus`. Checking if the
finite field is a Conway polynomial is now done by an implementation-
independent function.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14833>
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/groups/opt_out.
