Irreducible compositions of polynomials over finite fields
From MaRDI portal
Publication:648074
Abstract: The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.
Given an irreducible polynomial of degree \(n\) over \(\mathbb{F}_q\) and suitable elements in \(\mathbb{F}_{q^k}\) (for coprime numbers \(n\) and \(k\)), the composition method generates irreducible polynomials of degree \(nk\) over \(\mathbb{F}_q\). The authors demonstrate the method on several examples. In particular, they construct irreducible polynomials of degree \(n(q^m-1)\) and \(n(q^n+1)\) over \(\mathbb{F}_q\) from a given irreducible polynomial of degree \(n\) and a primitive polynomial of degree \(m\) over \(\mathbb{F}_q\).
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
- 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
- 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?)
- Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
- Linear Recurring Sequences
- On irreducible polynomials of certain types in finite fields
- ON NORMAL BASES OF A FINITE FIELD
- 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)- On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x]\) to \(\mathbb{F}_q [x]\)
- A recurrent construction of irreducible polynomials of fixed degree over finite fields
- Construction of irreducible polynomials through rational transformations
- Composed products and factors of cyclotomic polynomials over finite fields
- Factorization of a class of composed polynomials
- A note on composed products of polynomials over finite fields
- Irreducibility and multiplicative composition of polynomials over finite fields
- On coefficients of powers of polynomials and their compositions over finite fields
- scientific article; zbMATH DE number 4002227 (Why is no real title available?)
- On the reducibility of some composite polynomials over finite fields
- Recursive constructions of irreducible polynomials over finite fields
- scientific article; zbMATH DE number 1916565 (Why is no real title available?)
- Factorization of some composite polynomials over finite fields
- On the prime factors of _p(M)
- A Note on the Brawley-Carlitz Theorem on Irreducibility of Composed Products of Polynomials over Finite Fields
- Fixed points of the sum of divisors function on \({{\mathbb{F}}}_2[x]\)
- Construction of irreducible polynomials over finite fields
- Constructions of irreducible polynomials over finite fields with even characteristic
- Constructing irreducible polynomials recursively with a reverse composition method
- A new direction on constructing irreducible polynomials over finite fields
- On the construction of certain odd degree irreducible polynomials over finite fields
- Composed products and module 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\)
- Rational transformations over finite fields that are never irreducible
- Factorization and irreducibility of composed products
- Factorization of cyclotomic polynomial values at Mersenne prime polynomials
- A correspondence of certain irreducible polynomials over finite fields
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)
