The explicit construction of irreducible polynomials over finite fields
Let \(GF(q)\) denote the finite field of order \(q.\) Given a polynomial \(f(x)\) of degree \(n\) over \(GF(q),\) the reciprocal operator \(Q\) associates with \(f\) the reciprocal polynomial \(f^ Q\) defined by \(f^ Q(x)=x^ nf(x+x^{-1}).\) Generalizing results of \textit{D. Wiedemann} [Fibonacci Q. 26, 290-295 (1988; Zbl 0658.12012)]\ and \textit{H. Meyn} [Appl. Algebra Eng. Commun. Comput. 1, No. 1, 43-53 (1990; Zbl 0724.11062)]the author proves: Let \(f_ 0(x)\) be a monic polynomial of degree \(n\geq 1\) over \(GF(2)\) whose coefficients of \(x^{n-1}\) and of \(x\) are both \(1.\) For each \(m \geq 1\) define \(f_ m \) by \(f_ m(x)={{f_{m-1}}^ Q}(x).\) Then for each \(m, f_ m\) is an irreducible polynomial over \(GF(2)\) of degree \(n2^ m\) and order a divisor of \(2^{n2^{m-1}} +1.\) For any field \(F\) of characteristic not \(2,\) the reciprocal operator \(Q\) is replaced by the operator \(R\) which associates with a monic \(f\) of degree \(n\) over \(F\) the monic reciprocal polynomial \(f^ R\) defined by \(f^ R(x)=(2x)^ nf(2^{-1}(x+x^{-1}))=2^ nf^ Q(2^{- 1}x).\) Analogous to the above result for \(q=2,\) the author proves: Let \(f_ 0(x)\) be a monic irreducible polynomial of degree \(n \geq1\) over \(GF(q), q\) odd, where \(n\) is even if \(q\equiv 3 \)(mod 4). Suppose also that \(f_ 0(1)f_ 0(-1)\) is a non-square in \(GF(q).\) For each \(m\geq1\) define \(f_ m\) by \(f_ m(x)={{f_{m-1}}^ R}(x).\) Then for each \(m,\) \(f_ m\) is an irreducible polynomial over \(GF(q)\) of degree \(n2^ m\) and order a divisor of \(q^{n2^{m-1}}+1.\) Applications are then presented to the explicit construction of iterated presentations of several infinite algebraic extensions of a finite field, see \textit{J. V. Brawley} and \textit{G. E. Schnibben} [Infinite algebraic extensions of finite fields (Contemp. Math. 95) (1989; Zbl 0674.12009)]\ for a study of iterated presentations.
- Self-reciprocal irreducible polynomials over finite fields
- On the construction of irreducible self-reciprocal polynomials over finite fields
- A note on the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials
- Self-reciprocal polynomials over finite fields
- Explicit N-polynomials of 2-power degree over finite fields. I
- Sums of reciprocals of polynomials over finite fields
- A generalized counting and factoring method for polynomials over finite fields
- Enumeration of self-reciprocal irreducible monic polynomials with prescribed leading coefficients over a finite field
- Recursive constructions of irreducible polynomials over finite fields
- Constructions of irreducible polynomials over finite fields with even characteristic
- An enumeration formula for certain irreducible polynomials with an application to the construction of irreducible polynomials over the binary field
- scientific article; zbMATH DE number 3955054 (Why is no real title available?)
- scientific article; zbMATH DE number 4075228 (Why is no real title available?)
- Infinite Algebraic Extensions of Finite Fields
- On irreducible polynomials of certain types in finite fields
- On the construction of irreducible self-reciprocal polynomials over finite fields
- Some theorems on irreducible reciprocal polynomials over a finite field.
- Completely normal elements in iterated quadratic extensions of finite fields
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
- Finite field towers: Iterated presentation and complexity of arithmetic.
- On the construction of irreducible polynomials over finite fields via odd prime degree endomorphisms of elliptic curves
- Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
- Explicit N-polynomials of 2-power degree over finite fields. I
- Construction of irreducible polynomials using cubic transformation
- An iterative construction of irreducible polynomials reducible modulo every prime
- Iterated constructions of completely normal polynomials
- Infinite families of reciprocal monogenic polynomials and their Galois groups
- A recurrent construction of irreducible polynomials of fixed degree over finite fields
- On the construction of irreducible self-reciprocal polynomials over finite fields
- Sequences of irreducible polynomials without prescribed coefficients over odd prime fields
- Generalized reciprocals, factors of Dickson polynomials and generalized cyclotomic polynomials over finite fields
- Sequences of irreducible polynomials over odd prime fields via elliptic curve endomorphisms
- Recurrent methods for constructing irreducible polynomials over F_q of odd characteristics. II
- Explicit theorems on generator polynomials
- High order elements in finite fields arising from recursive towers
- On an iterated construction of irreducible polynomials over finite fields of even characteristic by Kyuregyan
- Constructing irreducible polynomials over finite fields
- Enumeration of a special class of irreducible polynomials in characteristic 2
- Elements of high order on finite fields from elliptic curves
- Transformations on irreducible binary polynomials
- On the iterations of certain maps \(X \mapsto K \cdot(X + X^{- 1})\) over finite fields of odd characteristic
- scientific article; zbMATH DE number 1047540 (Why is no real title available?)
- On the reducibility of some composite polynomials over finite fields
- Recursive constructions of irreducible polynomials over finite fields
- On the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials
- Construction of primitive polynomials over finite fields
- On the action of \(\text{GL}_2(\mathbb F_q)\) on irreducible polynomials over \(\mathbb F_q\)
- scientific article; zbMATH DE number 6327479 (Why is no real title available?)
- Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
- Constructing irreducible polynomials recursively with a reverse composition method
- A new direction on constructing irreducible polynomials over finite fields
- Field extensions defined by reciprocal polynomials
- Self-reciprocal irreducible polynomials with prescribed coefficients
- Irreducible compositions of polynomials over finite fields
- Iterative constructions of irreducible polynomials from isogenies
- Factorization of a class of polynomials over finite fields
- On the construction of certain odd degree irreducible polynomials over finite fields
- The R-transform as power map and its generalizations to higher degree
- Irreducible polynomials and linear recurring arrays
- Succinct arguments over towers of binary fields
- The inverse stability of Artin-Schreier polynomials over finite fields
- Rational transformations over finite fields that are never irreducible
- A correspondence of certain irreducible polynomials over finite fields
- Recursive constructions of N-polynomials over \(\text{GF}(2^s)\)
- Factors of Dickson polynomials over finite fields.
- On different families of invariant irreducible polynomials over \(\mathbb F_2\)
This page was built for publication: The explicit construction of irreducible polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200310)
