In this paper we have obtained some results regarding the number of roots and the irreducibility property of the polynomials which have the form axn + x + 1 over finite fields whose characteristic is 2.Some of these results appear as generalizations of previous results obtained by Berlekamp, Rumsey, and Solomon (1967, On the solution of algebraic equations over finite fields, Information and Control 10, 553‐564).We have also proposed a new method of studying equations in finite fields using the properties of the coefficients of certain characteristic polynomials related to these equations
In this paper we study the relation between coefficients of a polynomial over finite field Fq and th...
AbstractGiven the field Fq of characteristics p and an irreducible polynomial P(x)=cnxn+cn−1xn−1+⋯+c...
AbstractWe study the factorization of polynomials of the form Fr(x)=bxqr+1−axqr+dx−c over the finite...
In this paper we have obtained some results regarding the number of roots and the irreducibility pro...
In this thesis we consider some problems concerning polynomials over finite fields. The first topic...
In this paper we are going to see about finite fields, irreducible polynomials over finite fields, t...
In this paper we are going to see about finite fields, irreducible polynomials over finite fields, t...
Coefficients of polynomials over finite fields often encode information that can be applied in vario...
We are concerned with solving polynomial equations over rings. More precisely, given a commutative d...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
We are concerned with solving polynomial equations over rings. More precisely, given a commutative d...
AbstractWe study the polynomial f(x)=xq+1+ax+b over an arbitrary field F of characteristic p, where ...
AbstractA characterization of primitive polynomials, among irreducible polynomials, over a finite fi...
AbstractIn this paper we study the relation between coefficients of a polynomial over finite field F...
In this paper we study the relation between coefficients of a polynomial over finite field Fq and th...
AbstractGiven the field Fq of characteristics p and an irreducible polynomial P(x)=cnxn+cn−1xn−1+⋯+c...
AbstractWe study the factorization of polynomials of the form Fr(x)=bxqr+1−axqr+dx−c over the finite...
In this paper we have obtained some results regarding the number of roots and the irreducibility pro...
In this thesis we consider some problems concerning polynomials over finite fields. The first topic...
In this paper we are going to see about finite fields, irreducible polynomials over finite fields, t...
In this paper we are going to see about finite fields, irreducible polynomials over finite fields, t...
Coefficients of polynomials over finite fields often encode information that can be applied in vario...
We are concerned with solving polynomial equations over rings. More precisely, given a commutative d...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
We are concerned with solving polynomial equations over rings. More precisely, given a commutative d...
AbstractWe study the polynomial f(x)=xq+1+ax+b over an arbitrary field F of characteristic p, where ...
AbstractA characterization of primitive polynomials, among irreducible polynomials, over a finite fi...
AbstractIn this paper we study the relation between coefficients of a polynomial over finite field F...
In this paper we study the relation between coefficients of a polynomial over finite field Fq and th...
AbstractGiven the field Fq of characteristics p and an irreducible polynomial P(x)=cnxn+cn−1xn−1+⋯+c...
AbstractWe study the factorization of polynomials of the form Fr(x)=bxqr+1−axqr+dx−c over the finite...