Name
Abstract | ||
|---|---|---|
We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which does not use the theory of linear recurrences. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ffa.2014.09.006 | Finite Fields and Their Applications |
Keywords | Field | DocType |
11T06,11T71,12E05 | Combinatorics,Finite field,Primitive polynomial,Polynomial,Algebra,Mathematical proof,Primitive element,Irreducible polynomial,Mathematics | Journal |
Volume | Issue | ISSN |
31 | C | 1071-5797 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Samrith Ram | 1 | 20 | 3.52 |