A new direction on constructing irreducible polynomials over finite fields

DOI10.1016/j.ffa.2024.102368OpenAlexW4391218215WikidataQ129401822 ScholiaQ129401822MaRDI QIDQ6191065

Kaimin Cheng

Publication date: 6 March 2024

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2024.102368

zbMATH Keywords

iteration of rational functionsconstruction of irreducible polynomialsinfinite family of irreducible polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)

Cites Work

• Unnamed Item
• On the reducibility of some composite polynomials over finite fields
• An estimate on the number of stable quadratic polynomials
• Irreducible compositions of polynomials over finite fields
• The explicit construction of irreducible polynomials over finite fields
• On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x\) to \(\mathbb{F}_q [x]\)]
• A note on the construction of finite Galois fields \(\mathrm{GF}(p^n)\)
• ON STABLE QUADRATIC POLYNOMIALS
• Settled polynomials over finite fields

This page was built for publication: A new direction on constructing irreducible polynomials over finite fields