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

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

Mathematics Subject Classification ID

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

Cited In (12)

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

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)