On the reducibility of some composite polynomials over finite fields
From MaRDI portal
Publication:438878
DOI10.1007/s10623-011-9566-1zbMath1245.11115OpenAlexW2027491665MaRDI QIDQ438878
Publication date: 31 July 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9566-1
Related Items (3)
Factorization of a class of composed polynomials ⋮ A new direction on constructing irreducible polynomials over finite fields ⋮ A note on N-polynomials over finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
- Irreducible compositions of polynomials over finite fields
- On different families of invariant irreducible polynomials over \(\mathbb F_2\)
- The explicit construction of irreducible polynomials over finite fields
- Factorization over a finite field \(\mathbb F_{p^n}\) of the composite polynomials \(f\left(X^{p^r}-aX\right)\) where \(f(X)\) is an irreducible polynomial in \(\mathbb F_{p^n}(X)\)
- Factorization of irreducible polynomials over a finite field with the substitution \(x^{p^r}-x\) for x
- THE IRREDUCIBLE FACTORS OF (cx+d)xqm−(ax+b) OVER GF(q)
- Normal and Self-Dual Normal Bases from Factorization of $cx^{q + 1} + dx^q - ax - b$
- On irreducible polynomials of certain types in finite fields
- A Theorem of Dickson on Irreducible Polynomials
This page was built for publication: On the reducibility of some composite polynomials over finite fields