Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle
From MaRDI portal
Publication:2911530
DOI10.4169/math.mag.84.5.369zbMath1246.12003arXiv1001.0409OpenAlexW2962714692WikidataQ56059246 ScholiaQ56059246MaRDI QIDQ2911530
Publication date: 31 August 2012
Published in: Mathematics Magazine (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.0409
Polynomials in general fields (irreducibility, etc.) (12E05) Elementary algebra (educational aspects) (97H20) Groups, rings, fields (educational aspects) (97H40)
Related Items (7)
A new lower bound on the family complexity of Legendre sequences ⋮ A Tale of Two Cyclicities: Counting in Finite Cyclic Groups and Finite Fields ⋮ Uniform probability and natural density of mutually left coprime polynomial matrices over finite fields ⋮ Counting irreducible polynomials of degree \(r\) over \(\mathbb F_{q^n}\) and generating Goppa codes using the lattice of subfields of \(\mathbb F_{q^{nr}}\) ⋮ Similarity Classes of Linear Transformations ⋮ Visibly Irreducible Polynomials over Finite Fields ⋮ On atomic density of numerical semigroup algebras
This page was built for publication: Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle
