AbstractA characterization of primitive polynomials, among irreducible polynomials, over a finite field is established. Such characterization is determined by the number of nonzero terms in certain quotient of polynomials. The proof, which is a modification of the one discovered by Fitzgerald in 2003 yet revealing more general structure, is based principally on counting the number of occurrences of elements in a linear recurring sequence over a finite field
The topic of my thesis was counting irreducible polynomials. I began with some preliminary material ...
We discuss the problem of constructing a small subset of a finite field containing primitive element...
In this paper we study the relation between coefficients of a polynomial over finite field Fq and th...
AbstractA characterization of primitive polynomials, among irreducible polynomials, over a finite fi...
AbstractWe characterize primitive polynomials, among irreducible polynomials, by the number of terms...
AbstractLet GF(q) denote the finite field of order q, a power of a prime p, and m a positive integer...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
AbstractThe primitive elements of a finite field are those elements of the field that generate the m...
In this paper we are going to see about finite fields, irreducible polynomials over finite fields, t...
The Hansen–Mullen [Math. Comput. 59 (1992) 639–643, S47–S50] conjecture on primitive polynomials is ...
In this paper we are going to see about finite fields, irreducible polynomials over finite fields, t...
In this paper we have obtained some results regarding the number of roots and the irreducibility pro...
AbstractLet q be a prime power and Fq the finite field with q elements. We examine the existence of ...
In this note we significantly extend the range of published tables of primitive normal polynomials o...
The topic of my thesis was counting irreducible polynomials. I began with some preliminary material ...
We discuss the problem of constructing a small subset of a finite field containing primitive element...
In this paper we study the relation between coefficients of a polynomial over finite field Fq and th...
AbstractA characterization of primitive polynomials, among irreducible polynomials, over a finite fi...
AbstractWe characterize primitive polynomials, among irreducible polynomials, by the number of terms...
AbstractLet GF(q) denote the finite field of order q, a power of a prime p, and m a positive integer...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
AbstractThe primitive elements of a finite field are those elements of the field that generate the m...
In this paper we are going to see about finite fields, irreducible polynomials over finite fields, t...
The Hansen–Mullen [Math. Comput. 59 (1992) 639–643, S47–S50] conjecture on primitive polynomials is ...
In this paper we are going to see about finite fields, irreducible polynomials over finite fields, t...
In this paper we have obtained some results regarding the number of roots and the irreducibility pro...
AbstractLet q be a prime power and Fq the finite field with q elements. We examine the existence of ...
In this note we significantly extend the range of published tables of primitive normal polynomials o...
The topic of my thesis was counting irreducible polynomials. I began with some preliminary material ...
We discuss the problem of constructing a small subset of a finite field containing primitive element...
In this paper we study the relation between coefficients of a polynomial over finite field Fq and th...