Recursive constructions of irreducible polynomials over finite fields
From MaRDI portal
Publication:439081
DOI10.1016/j.ffa.2012.03.003zbMath1269.11121OpenAlexW2066229916MaRDI QIDQ439081
Sergey Abrahamyan, Melsik K. Kyureghyan, Mahmood Alizadeh
Publication date: 1 August 2012
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2012.03.003
Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06) Special polynomials in general fields (12E10)
Related Items (6)
Recursive construction of normal polynomials over finite fields ⋮ Constructions of irreducible polynomials over finite fields with even characteristic ⋮ Recursive constructions of k-normal polynomials using some rational transformations over finite fields ⋮ Construction of irreducible polynomials through rational transformations ⋮ On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x\) to \(\mathbb{F}_q [x]\)] ⋮ Construction of irreducible polynomials over finite fields
Cites Work
- Irreducible compositions of polynomials over finite fields
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics. II
- Explicit theorems on generator polynomials
- A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
- On irreducible polynomials of certain types in finite fields
- Unnamed Item
- Unnamed Item
This page was built for publication: Recursive constructions of irreducible polynomials over finite fields
