Iterated constructions of completely normal polynomials (Q1994972)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Iterated constructions of completely normal polynomials |
scientific article |
Statements
Iterated constructions of completely normal polynomials (English)
0 references
18 February 2021
0 references
Let \(\mathbb{F}_q\) be the finite field of \(q\) elements and \(n\) a positive integer. An element \(\alpha \in \mathbb{F}_{q^n}\) is said normal over \(\mathbb{F}_q\) if its \(\mathbb{F}_q\)-conjugates form an \(\mathbb{F}_q\)-vector space basis of \(\mathbb{F}_{q^n}\). An element \( \alpha \in \mathbb{F}_{q^n}\) is completely normal if it generates over any intermediate field \(\mathbb{F}_{q^d}\) (where \(d|n\)) a normal basis of \(\mathbb{F}_{q^n}\) over \(\mathbb{F}_{q^d}\). Let \(f \in \mathbb{F}_q[x]\) be an irreducible polynomial, \(f\) is called normal (completely normal) over \(\mathbb{F}_q[x]\) if any of its roots is normal (completely normal) in the extension \(\mathbb{F}_{\deg f}/\mathbb{F}_q\). Let \(\sigma \in \mathrm{GL}_2(\mathbb{F}_q)\) and \(t\) is a positive integer. In the paper under review, the author gives sequences of polynomials obtained by using the \(R_{\sigma, t}\)-transform, that start with a certain linear polynomial in \( \mathbb{F}_q[x] \), and establishes conditions that ensure that said sequences are sequences of completely normal polynomials over \(\mathbb{F}_q[x]\). The \(R_{\sigma, t}\)--transform were introduced in a recent work by \textit{A. Bassa} and \textit{R. Menares} [\url{arXiv:1909.02608}]. They give interactive constructions of irreducible polynomials over \(\mathbb{F}_q\) of growing degree. This interactive construction is a generalization of \textit{S. D. Cohen}'s \(R\)-transform [Des. Codes Cryptography 2, 169--174 (1992; Zbl 0768.11048)]. For this \(R\)-transform, R. Chapman provides explicit constructions of sequences of irreducible polynomials whose roots are completely normal elements [\textit{R. Chapman}, Finite Fields Appl. 3, No. 1, 1--10 (1997; Zbl 0952.11028)]. The author also gives a simple proof of Chapman's result mentioned before using his results and shows a generalization that allow the construction of completely normal polynomial families where the starting polynomial is not necessarily linear.
0 references
finite fields
0 references
normal polynomials
0 references
\(R\)-transform
0 references
0 references