A C++ template library for polynomials algebra over discrete integral domains
-
Updated
Dec 10, 2024 - C++
A C++ template library for polynomials algebra over discrete integral domains
A finite-field library in C++
This code computes a combinatorial object I call "n-maximal polynomial". Given a finite field F and a positive integer n, this object is a polynomial over F of degree at most 2n that has a maximal number of factorizations of a specific form. This work is motivated by an application to Rank-Metric Codes in the field of Coding Theory.
Part of the SPBU's programming course. C library that provides a set of operations for elements of Galois field.
Add a description, image, and links to the polynomials-over-finite-fields topic page so that developers can more easily learn about it.
To associate your repository with the polynomials-over-finite-fields topic, visit your repo's landing page and select "manage topics."