Probabilistic Algorithm in Finite Fields
We present probabilistic algorithms for the problems of finding an irreducible polynomial of degree n over a finite field, finding roots of a polynomial and factoring the polynomial into its irreducible factors over a finite field. All of these problems are of importance in algebraic coding theory...
| Main Author: | |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149500 |