A generalized counting and factoring method for polynomials over finite fields

zbMATH Open1211.11135MaRDI QIDQ3567487FDOQ3567487

Authors Ronald C. Mullin, Joseph L. Yucas, Gary L. Mullen

Publication date 17 June 2010

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20)

Recommendations

• Factorization of a class of polynomials over finite fields
• Generalizations of self-reciprocal polynomials
• Irreducible polynomials over finite fields. I
• On the construction of irreducible self-reciprocal polynomials over finite fields
• Generalization of a theorem of Carlitz

Cited in

(12)

• Generalization of a theorem of Carlitz
• A SURVEY OF FACTORIZATION COUNTING FUNCTIONS
• On the factorization of iterated polynomials
• Enumeration of a special class of irreducible polynomials in characteristic 2
• Generalizations of self-reciprocal polynomials
• The action of \(\mathrm{GL}_2(\mathbb{F}_q)\) on irreducible polynomials over \(\mathbb{F}_q\), revisited
• On some properties of polynomials over finite fields
• Construction of irreducible polynomials through rational transformations
• On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x]\) to \(\mathbb{F}_q [x]\)
• scientific article; zbMATH DE number 830028 (Why is no real title available?)
• The explicit construction of irreducible polynomials over finite fields
• On the action of \(\text{GL}_2(\mathbb F_q)\) on irreducible polynomials over \(\mathbb F_q\)

This page was built for publication: A generalized counting and factoring method for polynomials over finite fields

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