AbstractLet GF(q) denote the finite field of order q, a power of a prime p, and m a positive integer. Let Pqα(m) denote the number of primitive polynomials of degree m over GF(q) with trace α, where α∈GF(q). Cohen (Discrete Math. 83 (1990) 1; Lecture Notes Pure Appl. Math. 141 (1993)) proved that Pqα(m) is positive except for the cases P40(3)=Pq0(2)=0. In this paper, we provide several results on the enumeration problem of Pqα(m). Especially, we give several sufficient conditions for which Pqα(m) is constant for any nonzero trace α∈GF(q)
International audienceLet F a finite field, Q a given element of F[T] with positive degree and k a p...
AbstractWith one non-trivial exception, GF(qn) contains a primitive element of arbitrary trace over ...
AbstractUsing the estimates of character sums over Galois rings and Cohen's sieve, we prove that the...
AbstractA characterization of primitive polynomials, among irreducible polynomials, over a finite fi...
AbstractLet Fq denote the finite field of order q, a power of a prime p, and n be a positive integer...
AbstractWe characterize primitive polynomials, among irreducible polynomials, by the number of terms...
AbstractThe primitive elements of a finite field are those elements of the field that generate the m...
AbstractLet Fq denote the finite field of q elements, q an odd prime power, and let f(x)=xn+∑i=1nfix...
In this note we significantly extend the range of published tables of primitive normal polynomials o...
summary:In this paper we generalize the method used to prove the Prime Number Theorem to deal with f...
AbstractLet Fq be a finite field with q=pk elements. We prove that for any given n⩾7, and any elemen...
This thesis concerns existence of primitive polynomials over finite fields with one coefficient arbi...
This thesis concerns existence of primitive polynomials over finite fields with one coefficient arbi...
AbstractLet Fr denote a finite field with r elements. Let q be a power of a prime, and p1,p2, p3 be ...
This thesis concerns existence of primitive polynomials over finite fields with one coefficient arbi...
International audienceLet F a finite field, Q a given element of F[T] with positive degree and k a p...
AbstractWith one non-trivial exception, GF(qn) contains a primitive element of arbitrary trace over ...
AbstractUsing the estimates of character sums over Galois rings and Cohen's sieve, we prove that the...
AbstractA characterization of primitive polynomials, among irreducible polynomials, over a finite fi...
AbstractLet Fq denote the finite field of order q, a power of a prime p, and n be a positive integer...
AbstractWe characterize primitive polynomials, among irreducible polynomials, by the number of terms...
AbstractThe primitive elements of a finite field are those elements of the field that generate the m...
AbstractLet Fq denote the finite field of q elements, q an odd prime power, and let f(x)=xn+∑i=1nfix...
In this note we significantly extend the range of published tables of primitive normal polynomials o...
summary:In this paper we generalize the method used to prove the Prime Number Theorem to deal with f...
AbstractLet Fq be a finite field with q=pk elements. We prove that for any given n⩾7, and any elemen...
This thesis concerns existence of primitive polynomials over finite fields with one coefficient arbi...
This thesis concerns existence of primitive polynomials over finite fields with one coefficient arbi...
AbstractLet Fr denote a finite field with r elements. Let q be a power of a prime, and p1,p2, p3 be ...
This thesis concerns existence of primitive polynomials over finite fields with one coefficient arbi...
International audienceLet F a finite field, Q a given element of F[T] with positive degree and k a p...
AbstractWith one non-trivial exception, GF(qn) contains a primitive element of arbitrary trace over ...
AbstractUsing the estimates of character sums over Galois rings and Cohen's sieve, we prove that the...