Opened 9 years ago

Last modified 9 years ago

#14833 closed enhancement

Make choosing irreducible polynomials independent of finite field implementations — at Initial Version

Reported by: Peter Bruin Owned by: Clément Pernet
Priority: major Milestone: sage-5.12
Component: finite rings Keywords: polynomials
Cc: Xavier Caruso Merged in:
Authors: Peter Bruin Reviewers:
Report Upstream: N/A Work issues:
Branch: Commit:
Dependencies: #14832 Stopgaps:

Status badges

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.

Change History (0)

Note: See TracTickets for help on using tickets.