berlekamp.git/src, branch master A simple manual implementation of the Berlekamp algorithm. Refined 2023-12-07T05:46:09+00:00 JSDurand mmemmew@gmail.com 2023-12-07T05:46:09+00:00 c7946d2610e7c166d00f69c54126ecabe760d2c1 * src/lib.rs: Now the `factors` function directly finds all irreducible factors of the polynomial without resoting to manual inspections when the polynomial is not square-free. Also some quality-of-life improvements were made. * src/main.rs: Now has the option of searching for primes modulo which the polynomial is irreducible, up till a given bound. This is useful if I am curious to know whether such small primes exist. 
* src/lib.rs: Now the `factors` function directly finds all
  irreducible factors of the polynomial without resoting to manual
  inspections when the polynomial is not square-free.  Also some
  quality-of-life improvements were made.

* src/main.rs: Now has the option of searching for primes modulo which
  the polynomial is irreducible, up till a given bound.  This is
  useful if I am curious to know whether such small primes exist.
initial commit 2023-12-05T19:44:28+00:00 JSDurand mmemmew@gmail.com 2023-12-05T19:44:28+00:00 5d7ae639739e1b5389bc94c227aeb6661cb8eab1 A manual implementation of the Berlekamp algorithm for finding irreducible factors of polynomials over finite fields. 
A manual implementation of the Berlekamp algorithm for finding
irreducible factors of polynomials over finite fields.