The explicit construction of irreducible polynomials over finite fields (Q1200310): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Infinite Algebraic Extensions of Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some theorems on irreducible reciprocal polynomials over a finite field. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On irreducible polynomials of certain types in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of irreducible self-reciprocal polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enumeration formula for certain irreducible polynomials with an application to the construction of irreducible polynomials over the binary field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3724438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807331 / rank
 
Normal rank

Latest revision as of 11:53, 17 May 2024

scientific article
Language Label Description Also known as
English
The explicit construction of irreducible polynomials over finite fields
scientific article

    Statements

    The explicit construction of irreducible polynomials over finite fields (English)
    0 references
    0 references
    16 January 1993
    0 references
    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.
    0 references
    0 references
    finite field
    0 references
    irreducible polynomial
    0 references
    construction of iterated presentations infinite algebraic extensions
    0 references
    0 references