Irreducible polynomials with prescribed trace and restricted norm
From MaRDI portal
Publication:3174652
Abstract: Let GF(q), q=p^r, be a finite field with a primitive element g. In this paper we use exponential sums and Jacobi sums to compute the number of the irreducible polynomials of degree m over GF(q) with trace fixed and norm restricted to a coset of a subgroup <g^s>, s|(q-1). We give the number explicitly for s=2, 3, 4 when q=p, and for s|(p^e+1) when r=2en. Finally, we give explicit formulae for the number when both trace and norm are fixed, p=2 and m =< 30.
Recommendations
- On enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and norm
- Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm
- Irreducible polynomials over finite fields. I
- Irreducible polynomials over finite fields with prescribed trace/prescribed constant term
- The number of irreducible polynomials over finite fields with vanishing trace and reciprocal trace
Cited in
(10)- Generators of finite fields with powers of trace zero and cyclotomic function fields
- On enumeration of irreducible polynomials and related objects over a finite field with respect to their trace and norm
- On Katz's bound for the number of elements with given trace and norm
- A generalization of a lemma of Sullivan
- A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields
- A new proof of the Hansen-Mullen irreducibility conjecture
- Using trace to identify irreducible polynomials
- Trace- and norm-compatible extensions of finite fields
- The number of irreducible polynomials of degree \(n\) over \(\mathbb F_q\) with given trace and constant terms
- New optimal optical orthogonal codes by restrictions to subgroups
This page was built for publication: Irreducible polynomials with prescribed trace and restricted norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174652)