-
-
Notifications
You must be signed in to change notification settings - Fork 673
Description
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.
This is a dependency of #12142.
Apply: attachment: trac_14833-FiniteField_polynomial_choice.patch
Depends on #14832
CC: @xcaruso
Component: finite rings
Keywords: polynomials
Author: Peter Bruin
Reviewer: Jean-Pierre Flori
Merged: sage-5.12.beta2
Issue created by migration from https://trac.sagemath.org/ticket/14833