Enumerating irreducible polynomials over the binary field

DOI10.1142/S1793830925500855MaRDI QIDQ7303561zbMATH OpenFDO

Authors Joseph Tonien

Publication date 24 July 2026

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830925500855

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Finite fields (field-theoretic aspects) (12E20) Symbolic computation and algebraic computation (68W30)

Cites work

• A New Algorithm for Factoring Polynomials Over Finite Fields
• Algebra.
• Algebraic coding theory
• Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle
• Factoring Polynomials Over Large Finite Fields
• Fundamentals of Error-Correcting Codes
• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• Mathematics of public key cryptography.
• Möbius polynomials
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• Obtaining Specified Irreducible Polynomials over Finite Fields
• Probabilistic Algorithms in Finite Fields
• Visibly irreducible polynomials over finite fields

This page was built for publication: Enumerating irreducible polynomials over the binary field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7303561)