On the construction of irreducible and primitive polynomials from F_q^m [x] to F_q [x]

DOI10.1016/J.FFA.2021.101971MaRDI QIDQ2066396zbMATH OpenOpenAlexFDO

Authors Ahmed Cherchem, Soufyane Bouguebrine, Hamza Boughambouz

Publication date 14 January 2022

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

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

zbMATH Keywords

BCH codecompanion matrixfinite fieldirreducible polynomialprimitive polynomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Cyclic codes (94B15)

Recommendations

• A characterization of primitive polynomials over finite fields.
• A construction of primitive polynomials over finite fields
• scientific article; zbMATH DE number 3955054
• Finding irreducible and primitive polynomials
• scientific article; zbMATH DE number 4002227

Cites work

• A construction of primitive polynomials over finite fields
• A generalized counting and factoring method for polynomials over finite fields
• Algebraic curves over a finite field
• Algebraic Function Fields and Codes
• Critères d'irréductibilite des polynômes composés à coefficients dans un corps fini
• Fundamentals of Error-Correcting Codes
• Handbook of finite fields
• scientific article; zbMATH DE number 424718 (Why is no real title available?)
• scientific article; zbMATH DE number 3147923 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1973372 (Why is no real title available?)
• scientific article; zbMATH DE number 1361739 (Why is no real title available?)
• Irreducible compositions of polynomials over finite fields
• Irreducible compositions of polynomials over finite fields of even characteristic
• On a class of error correcting binary group codes
• On irreducible polynomials of certain types in finite fields
• Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
• Recursive constructions of irreducible polynomials over finite fields
• The great trinomial hunt

Cited in

(5)

• A characterization of primitive polynomials over finite fields.
• A new direction on constructing irreducible polynomials over finite fields
• The inverse stability of Artin-Schreier polynomials over finite fields
• A characterization and an explicit description of all primitive polynomials of degree two
• On the primitivity of the trinomial \(x^n+ax^k+b\) over \(\mathbb{F}_q\)

This page was built for publication: On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x]\) to \(\mathbb{F}_q [x]\)

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