summary:We deal with the construction of sequences of irreducible polynomials with coefficients in finite fields of even characteristic. We rely upon a transformation used by Kyuregyan in 2002, which generalizes the $Q$-transform employed previously by Varshamov and Garakov (1969) as well as by Meyn (1990) for the synthesis of irreducible polynomials. While in the iterative procedure described by Kyuregyan the coefficients of the initial polynomial of the sequence have to satisfy certain hypotheses, in the present paper these conditions are removed. We construct infinite sequences of irreducible polynomials of non-decreasing degree starting from any irreducible polynomial
Abstract. In this paper we study the irreducibility of some compos-ite polynomials, constructed by a...
AbstractIn this paper, the irreducibility of the composition of polynomials (dx2+rx+h)nP(ax2+bx+cdx2...
AbstractLet GF(q) be the finite field of order q, let Q(x) be an irreducible polynomial in GF(qi)[x]...
summary:We deal with the construction of sequences of irreducible polynomials with coefficients in f...
The paper is devoted to constructive theory of synthesis of irreducible polynomials and irreducible ...
AbstractThe paper is devoted to constructive theory of synthesis of irreducible polynomials and irre...
The construction of irreducible polynomials over finite fields is currently a strong subject of inte...
In [6] the basic definitions and theorems of abstract algebra are defined and developed. The fundame...
In this thesis we related the notion on constructions of irreducible polynomials over finite fields....
AbstractGiven the field Fq of characteristics p and an irreducible polynomial P(x)=cnxn+cn−1xn−1+⋯+c...
In this note by using Dickson’s theorem we construct families of irreducible polynomials of degree 4...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
A method is presented for generating random numbers with uniform distribution using linear recurren...
International audienceWe present a randomized algorithm that on input a finite field $K$ with $q$ el...
A method is presented for generating random numbers with uniform distribution using linear recurrenc...
Abstract. In this paper we study the irreducibility of some compos-ite polynomials, constructed by a...
AbstractIn this paper, the irreducibility of the composition of polynomials (dx2+rx+h)nP(ax2+bx+cdx2...
AbstractLet GF(q) be the finite field of order q, let Q(x) be an irreducible polynomial in GF(qi)[x]...
summary:We deal with the construction of sequences of irreducible polynomials with coefficients in f...
The paper is devoted to constructive theory of synthesis of irreducible polynomials and irreducible ...
AbstractThe paper is devoted to constructive theory of synthesis of irreducible polynomials and irre...
The construction of irreducible polynomials over finite fields is currently a strong subject of inte...
In [6] the basic definitions and theorems of abstract algebra are defined and developed. The fundame...
In this thesis we related the notion on constructions of irreducible polynomials over finite fields....
AbstractGiven the field Fq of characteristics p and an irreducible polynomial P(x)=cnxn+cn−1xn−1+⋯+c...
In this note by using Dickson’s theorem we construct families of irreducible polynomials of degree 4...
grantor: University of TorontoThis thesis investigates several algebraic algorithms that d...
A method is presented for generating random numbers with uniform distribution using linear recurren...
International audienceWe present a randomized algorithm that on input a finite field $K$ with $q$ el...
A method is presented for generating random numbers with uniform distribution using linear recurrenc...
Abstract. In this paper we study the irreducibility of some compos-ite polynomials, constructed by a...
AbstractIn this paper, the irreducibility of the composition of polynomials (dx2+rx+h)nP(ax2+bx+cdx2...
AbstractLet GF(q) be the finite field of order q, let Q(x) be an irreducible polynomial in GF(qi)[x]...