Finite fields
The Number of Irreducible Polynomials and Lyndon Words with Given Trace
SIAM Journal on Discrete Mathematics
A recurrent method for constructing irreducible polynomials over finite fields
CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
On certain diagonal equations over finite fields
Finite Fields and Their Applications
Explicit theorems on generator polynomials
Finite Fields and Their Applications
Hi-index | 0.00 |
We obtain an equivalent version of Carlitz's formula for the number of monic irreducible polynomials of degree n and trace @c0 over a finite field via an integer recurrence. Similar expressions for the @c=0 case are also given. We also obtain formulas for the number of monic irreducible polynomials of degree n and prescribed constant term.