Name
Abstract | ||
|---|---|---|
We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by equivalence classes of polynomials with prescribed coefficients. Simplified expressions are derived for some special cases. Our results extend some earlier results. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.ffa.2022.102023 | Finite Fields and Their Applications |
Keywords | DocType | Volume |
11T06,11T55,11T23,12Y05 | Journal | 80 |
ISSN | Citations | PageRank |
1071-5797 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhicheng Gao | 1 | 0 | 1.35 |
| Simon Kuttner | 2 | 0 | 1.01 |
| Qiang Wang | 3 | 237 | 37.93 |