Irreducible compositions of polynomials over finite fields

DOI10.1007/S10623-010-9478-5MaRDI QIDQ648074zbMATH OpenOpenAlexFDO

Authors Gohar M. Kyureghyan, Melsik K. Kuyregyan

Publication date 22 November 2011

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1008.1863

zbMATH Keywords

finite fieldpolynomial compositionirreducible polynomialexplicit familyset of coefficients

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Abstract: The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

Recommendations

• Construction of irreducible polynomials over finite fields
• A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
• Recursive constructions of irreducible polynomials over finite fields
• Factorization of composite polynomials over finite fields
• On the reducibility of some composite polynomials over finite fields

Cites work

• scientific article; zbMATH DE number 424718 (Why is no real title available?)
• scientific article; zbMATH DE number 3121635 (Why is no real title available?)
• scientific article; zbMATH DE number 5296403 (Why is no real title available?)
• scientific article; zbMATH DE number 3955054 (Why is no real title available?)
• scientific article; zbMATH DE number 691486 (Why is no real title available?)
• Completely normal elements in iterated quadratic extensions of finite fields
• Explicit N-polynomials of 2-power degree over finite fields. I
• Explicit theorems on generator polynomials
• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
• Linear Recurring Sequences
• ON NORMAL BASES OF A FINITE FIELD
• On irreducible polynomials of certain types in finite fields
• Recurrent methods for constructing irreducible polynomials over F_q of odd characteristics. II
• Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
• The explicit construction of irreducible polynomials over finite fields

Cited in

(28)

• Constructing irreducible polynomials recursively with a reverse composition method
• Factorization and irreducibility of composed products
• Factorization of a class of composed polynomials
• A Note on the Brawley-Carlitz Theorem on Irreducibility of Composed Products of Polynomials over Finite Fields
• On the prime factors of _p(M)
• On the reducibility of some composite polynomials over finite fields
• Factorization of some composite polynomials over finite fields
• Recursive constructions of irreducible polynomials over finite fields
• Composed products and module polynomials over finite fields
• A recurrent construction of irreducible polynomials of fixed degree over finite fields
• scientific article; zbMATH DE number 1916565 (Why is no real title available?)
• Construction of irreducible polynomials through rational transformations
• A new direction on constructing irreducible polynomials over finite fields
• A correspondence of certain irreducible polynomials over finite fields
• Fixed points of the sum of divisors function on \({{\mathbb{F}}}_2[x]\)
• On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x]\) to \(\mathbb{F}_q [x]\)
• Constructions of irreducible polynomials over finite fields with even characteristic
• On the construction of certain odd degree irreducible polynomials over finite fields
• A note on composed products of polynomials over finite fields
• Factorization of cyclotomic polynomial values at Mersenne prime polynomials
• scientific article; zbMATH DE number 4002227 (Why is no real title available?)
• Composed products and factors of cyclotomic polynomials over finite fields
• The inverse stability of Artin-Schreier polynomials over finite fields
• Closed formulas for the generators of all constacyclic codes and for the factorization of \(X^{n} - 1\), the \(n\)-th cyclotomic polynomial and every composition of the form \(f(X^n)\) over a finite field for arbitrary positive integers \(n\)
• Irreducibility and multiplicative composition of polynomials over finite fields
• On coefficients of powers of polynomials and their compositions over finite fields
• Construction of irreducible polynomials over finite fields
• Rational transformations over finite fields that are never irreducible

This page was built for publication: Irreducible compositions of polynomials over finite fields

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