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

May 19, 2020 Β· Declared Dead Β· πŸ› Designs, Codes and Cryptography

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Yağmur Γ‡akΔ±roğlu, Oğuz Yayla, Emrah Sercan YΔ±lmaz arXiv ID 2005.09402 Category math.NT Cross-listed cs.CR, cs.IT Citations 2 Venue Designs, Codes and Cryptography Last Checked 4 months ago
Abstract
We present the formula for the number of monic irreducible polynomials of degree $n$ over the finite field $\mathbb F_q$ where the coefficients of $x^{n-1}$ and $x$ vanish for $n\ge3$. In particular, we give a relation between rational points of algebraic curves over finite fields and the number of elements $a\in\mathbb 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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” math.NT

Died the same way β€” πŸ‘» Ghosted