On completely free elements in finite fields (Q1321563)

From MaRDI portal
Revision as of 13:13, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
On completely free elements in finite fields
scientific article

    Statements

    On completely free elements in finite fields (English)
    0 references
    0 references
    0 references
    7 November 1995
    0 references
    Let \(q>1\) be a prime power and \(m>1\) an integer and \(GF (q^ m)\) the Galois field of order \(q^ m\). Let \(\sigma: GF (q^ m) \to GF (q^ m)\), \(\nu\to \nu^ q\) be the Frobenius automorphism of \(GF (q^ m)\) over \(GF (q)\). The Galois group of \(GF (q^ m)\) over \(GF (q)\) is cyclic of order \(m\) and is generated by \(\sigma\). \(GF (q^ d)\) is a subfield of \(GF (q^ m)\) iff \(d\mid m\). The additive group \((GF (q^ m),+)\) of \(GF (q^ m)\) becomes a cyclic \(GF (q^ d) [x ]\)-module with scalar multiplication defined by: \[ (f,\nu)_ d= \sum_ i f_ i \nu^{q^{di}} \] for the polynomial \(f\) over \(GF (q^ d)\) and \(\nu\in GF (q^ m)\). The module is denoted by \(GF (q^ m, q^ d, \sigma^ d)\). A generator of \(GF (q^ m, q^ d, \sigma^ d)\), say \(w\), is called a free element of \(GF (q^ m)\) over \(GF (q^ d)\) and the set \[ \{w, \sigma^ d (w), \cdots, \sigma^{m-d} (w)\} \] is a normal basis of \(GF (q^ m)\) over \(GF (q^ d)\). The different module structures of \((GF (q^ m), +)\), arising from the different intermediate fields are studied using cyclotomic polynomials. An element of \(GF (q^ m)\) over \(GF (q)\) which is free with respect to any intermediate field is called completely free in \(GF (q^ m)\) over \(GF (q)\). The existence of completely free elements was previously established by \textit{D. Blessenohl} and \textit{K. Johnsen} [J. Algebra 103, 141-159 (1986; Zbl 0607.12011)]. A detailed, simpler and constructive proof of this theorem is given for the case \(m\) a prime power from which the general can be shown to follow. Also, a recursive formula is given for the number of completely free elements in \(GF (q^ m)\) over \(GF (q)\) for the case when \(m\) is a prime power.
    0 references
    0 references
    0 references
    finite fields
    0 references
    normal bases
    0 references
    free elements
    0 references