Irreducible compositions of polynomials over finite fields

DOI10.1007/S10623-010-9478-5zbMATH Open1248.11098arXiv1008.1863OpenAlexW1982843093MaRDI QIDQ648074FDOQ648074

Authors: Gohar M. Kyureghyan, Melsik K. Kuyregyan 

Publication date: 22 November 2011

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

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

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

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

zbMATH Keywords

finite fieldpolynomial compositionirreducible polynomialexplicit familyset of coefficients

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The explicit construction of irreducible polynomials over finite fields
• Title not available (Why is that?)
• Linear Recurring Sequences
• Title not available (Why is that?)
• On irreducible polynomials of certain types in finite fields
• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
• 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
• ON NORMAL BASES OF A FINITE FIELD
• Completely normal elements in iterated quadratic extensions of finite fields
• Explicit N-polynomials of \(2\)-power degree over finite fields. I
• Title not available (Why is that?)

Cited In (22)

• Factorization of a class of composed polynomials
• A Note on the Brawley-Carlitz Theorem on Irreducibility of Composed Products of Polynomials over Finite Fields
• Factorization of some composite polynomials over finite fields
• On the reducibility of some composite polynomials over finite fields
• Composed products and module polynomials over finite fields
• Recursive constructions of irreducible polynomials over finite fields
• A recurrent construction of irreducible polynomials of fixed degree over finite fields
• Title not available (Why is that?)
• 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]\)
• Constructions of irreducible polynomials over finite fields with even characteristic
• On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x]\) to \(\mathbb{F}_q [x]\)
• On the construction of certain odd degree irreducible polynomials over finite fields
• A note on composed products of polynomials over finite fields
• Title not available (Why is that?)
• Composed products and factors of cyclotomic polynomials over finite fields
• Title not available (Why is that?)
• Construction of irreducible 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
• Constructing irreducible polynomials recursively with a reverse composition method

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)