In this work, a new construction based on companion matrices of primitive polynomials is provided. Given two primitive polynomials over the finite fields (Formula presented.) and (Formula presented.), we construct a ring isomorphism that transforms the companion matrix of the primitive polynomial over (Formula presented.) into a matrix with elements in (Formula presented.) whose characteristic polynomial is another primitive polynomial over (Formula presented.). © 2017 Informa UK Limited, trading as Taylor & Francis Group1
We study of the arithmetic of polynomials under the operation of functional composition, namely, the...
AbstractLet Fq be a finite field with q=pk elements. We prove that for any given n⩾7, and any elemen...
AbstractAlthough it is easy to prove that two finite fields having the same cardinality are isomorph...
In this work, a new construction based on companion matrices of primitive polynomials is provided. G...
In this work, a new construction based on companion matrices of primitive polynomials is provided. G...
In this work, a new construction based on companion matrices of primitive polynomials is provided. G...
This report lists the primitive polynomials over GF(3) of degree 2 through 11. These polynomials wer...
AbstractWe give a conjectural deterministic algorithm for computing primitive elements of extensions...
Several mathematical results and new computational methods are presented for primitive elements and ...
AbstractThe primitive elements of a finite field are those elements of the field that generate the m...
The Hansen–Mullen [Math. Comput. 59 (1992) 639–643, S47–S50] conjecture on primitive polynomials is ...
In this note we significantly extend the range of published tables of primitive normal polynomials o...
AbstractLet Fq denote the finite field of q elements, q an odd prime power, and let f(x)=xn+∑i=1nfix...
AbstractA characterization of primitive polynomials, among irreducible polynomials, over a finite fi...
AbstractWe characterize primitive polynomials, among irreducible polynomials, by the number of terms...
We study of the arithmetic of polynomials under the operation of functional composition, namely, the...
AbstractLet Fq be a finite field with q=pk elements. We prove that for any given n⩾7, and any elemen...
AbstractAlthough it is easy to prove that two finite fields having the same cardinality are isomorph...
In this work, a new construction based on companion matrices of primitive polynomials is provided. G...
In this work, a new construction based on companion matrices of primitive polynomials is provided. G...
In this work, a new construction based on companion matrices of primitive polynomials is provided. G...
This report lists the primitive polynomials over GF(3) of degree 2 through 11. These polynomials wer...
AbstractWe give a conjectural deterministic algorithm for computing primitive elements of extensions...
Several mathematical results and new computational methods are presented for primitive elements and ...
AbstractThe primitive elements of a finite field are those elements of the field that generate the m...
The Hansen–Mullen [Math. Comput. 59 (1992) 639–643, S47–S50] conjecture on primitive polynomials is ...
In this note we significantly extend the range of published tables of primitive normal polynomials o...
AbstractLet Fq denote the finite field of q elements, q an odd prime power, and let f(x)=xn+∑i=1nfix...
AbstractA characterization of primitive polynomials, among irreducible polynomials, over a finite fi...
AbstractWe characterize primitive polynomials, among irreducible polynomials, by the number of terms...
We study of the arithmetic of polynomials under the operation of functional composition, namely, the...
AbstractLet Fq be a finite field with q=pk elements. We prove that for any given n⩾7, and any elemen...
AbstractAlthough it is easy to prove that two finite fields having the same cardinality are isomorph...