scientific article; zbMATH DE number 26837

MaRDI QIDQ3983476zbMATH OpenFDO

Authors

Publication date 27 June 1992

zbMATH Keywords

complexityeven characteristicfinite fieldirreducible polynomialsrecurrent method

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
• scientific article; zbMATH DE number 4002227
• A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
• scientific article; zbMATH DE number 3955054

Cited in

(8)

• Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
• On an iterated construction of irreducible polynomials over finite fields of even characteristic by Kyuregyan
• A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
• scientific article; zbMATH DE number 3955054 (Why is no real title available?)
• scientific article; zbMATH DE number 4002227 (Why is no real title available?)
• scientific article; zbMATH DE number 4031828 (Why is no real title available?)
• scientific article; zbMATH DE number 4031829 (Why is no real title available?)
• An enumeration formula for certain irreducible polynomials with an application to the construction of irreducible polynomials over the binary field

This page was built for publication:

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