The number of irreducible polynomials over finite fields with vanishing trace and reciprocal trace

05/19/2020
by   Yaǧmur Çakıroǧlu, et al.
0

We present the formula for the number of monic irreducible polynomials of degree n over the finite field F_q where the coefficients of x^n-1 and x vanish for n>3. In particular, we give a relation between rational points of algebraic curves over finite fields and the number of elements a∈F_q^n for which Trace(a)=0 and Trace(a^-1)=0. Besides, we apply the formula to give an upper bound on the number of distinct constructions of a family of sequences with good family complexity and cross-correlation measure.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2020

New Upper Bounds for Trace Reconstruction

We improve the upper bound on trace reconstruction to (O(n^1/5))....
research
01/10/2020

On the distribution of orders of Frobenius action on ℓ-torsion of abelian surfaces

The computation of the order of Frobenius action on the ℓ-torsion is a p...
research
11/08/2022

Bounds on the differential uniformity of the Wan-Lidl polynomials

We study the differential uniformity of the Wan-Lidl polynomials over fi...
research
08/19/2019

Simple formula for integration of polynomials on a simplex

We show that integrating a polynomial of degree t on an arbitrary simple...
research
08/30/2017

Identity Testing from High Powers of Polynomials of Large Degree over Finite Fields

We consider the problem of identity testing of two "hidden" monic polyno...
research
12/13/2021

Further improvement on index bounds

In this paper we obtain further improvement of index bounds for characte...
research
05/06/2019

Two constructions of asymptotically optimal codebooks via the trace functions

In this paper, we present two new constructions of complex codebooks wit...

Please sign up or login with your details

Forgot password? Click here to reset