|
This article is cited in 18 scientific papers (total in 18 papers)
Construction of polinomials irreducible over a finite field with linearly independent roots
I. A. Semaev
Abstract:
For any $t\geqslant1$ the author gives a method of constructing a matrix $X$ – the multiplication table for a certain normal basis of the finite field $F_{q^t}$ over $F_q$, where $q$ is a power of a prime $p$. The characteristic polynomial of $X$ is an irreducible polynomial of degree $t$ with coefficients in $F_q$, whose roots are linearly independent over $F_q$.
In order to construct the matrix $X$, and thus an irreducible polynomial with linearly independent roots, one needs to perform no more than $O(\max(t^4,r^7\ln t/\ln r))$ additions and multiplications in $F_q$ (where $r$ is the greatest prime divisor of $t$).
Bibliography: 3 titles.
Received: 14.12.1985 and 03.09.1987
Citation:
I. A. Semaev, “Construction of polinomials irreducible over a finite field with linearly independent roots”, Mat. Sb. (N.S.), 135(177):4 (1988), 520–532; Math. USSR-Sb., 63:2 (1989), 507–519
Linking options:
https://www.mathnet.ru/eng/sm1722https://doi.org/10.1070/SM1989v063n02ABEH003288 https://www.mathnet.ru/eng/sm/v177/i4/p520
|
Statistics & downloads: |
Abstract page: | 1775 | Russian version PDF: | 626 | English version PDF: | 54 | References: | 64 | First page: | 1 |
|