On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x]\) to \(\mathbb{F}_q [x]\)

DOI10.1016/j.ffa.2021.101971zbMath1484.11215OpenAlexW3215902985MaRDI QIDQ2066396

Soufyane Bouguebrine, Hamza Boughambouz, Ahmed Cherchem

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

finite fieldcompanion matrixirreducible polynomialprimitive polynomialBCH code

Mathematics Subject Classification ID

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

Related Items

A new direction on constructing irreducible polynomials over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive constructions of irreducible polynomials over finite fields
• Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
• Irreducible compositions of polynomials over finite fields
• Irreducible compositions of polynomials over finite fields of even characteristic
• Handbook of Finite Fields
• The great trinomial hunt
• On a class of error correcting binary group codes
• 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
• A construction of primitive polynomials over finite fields
• On irreducible polynomials of certain types in finite fields