# Irreducible polynomials with prescribed trace and restricted norm

Source: [Irreducible polynomials with prescribed trace and restricted norm](<https://www.sota2.com/research/paper/68fa4da41e209131ce95623e>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:55:05.445Z

Authors: K. Kononen, M. Moisio, M. Rinta-aho, K. Vaananen

Published: 2007-10-15T10:24:55.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/0710.2767>)

[PDF](<https://arxiv.org/pdf/0710.2767.pdf>)
