DOIAbstract
In this paper we construct an infinite sequence of binary irreducible polynomials starting from any irreducible polynomial
In this paper we construct an infinite sequence of binary irreducible polynomials starting from any irreducible polynomial
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials th...
We study a class of Linear Feedback Shift Registers (LFSRs) with characteristic polynomial f(x) = p(...
AbstractThe main result of this paper a new algorithm for constructing an irreducible polynomial of ...
The paper is devoted to constructive theory of synthesis of irreducible polynomials and irreducible ...
Using the natural action of GL2(F2) S3 over F2[X], one can define different classes of polynomials s...
summary:We deal with the construction of sequences of irreducible polynomials with coefficients in f...
Abstract. In this paper we derive factorizations and representations of a polynomial analogue of an ...
A Barker sequence is a finite sequence a0,..., an−1, each term ±1, for which every sum Pi aiai+k wit...
AbstractWe count the number of irreducible polynomials in several variables of a given degree over a...
One of the fundamental tasks of Symbolic Computation is the factorization of polynomials into irredu...
In this paper we construct infinite sequences of monic irreducible polynomials with coefficients in ...
Any irreducible polynomial f(x) in [special characters omitted][x] such that the set of values f([sp...
We prove an irreducibility criterion for polynomials with power series coefficients generalizing pre...
. In this paper we study the irreducibility of some composite polynomials, constructed by a polynom...
107 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984.In this dissertation we prese...
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials th...
We study a class of Linear Feedback Shift Registers (LFSRs) with characteristic polynomial f(x) = p(...
AbstractThe main result of this paper a new algorithm for constructing an irreducible polynomial of ...
The paper is devoted to constructive theory of synthesis of irreducible polynomials and irreducible ...
Using the natural action of GL2(F2) S3 over F2[X], one can define different classes of polynomials s...
summary:We deal with the construction of sequences of irreducible polynomials with coefficients in f...
Abstract. In this paper we derive factorizations and representations of a polynomial analogue of an ...
A Barker sequence is a finite sequence a0,..., an−1, each term ±1, for which every sum Pi aiai+k wit...
AbstractWe count the number of irreducible polynomials in several variables of a given degree over a...
One of the fundamental tasks of Symbolic Computation is the factorization of polynomials into irredu...
In this paper we construct infinite sequences of monic irreducible polynomials with coefficients in ...
Any irreducible polynomial f(x) in [special characters omitted][x] such that the set of values f([sp...
We prove an irreducibility criterion for polynomials with power series coefficients generalizing pre...
. In this paper we study the irreducibility of some composite polynomials, constructed by a polynom...
107 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984.In this dissertation we prese...
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials th...
We study a class of Linear Feedback Shift Registers (LFSRs) with characteristic polynomial f(x) = p(...
AbstractThe main result of this paper a new algorithm for constructing an irreducible polynomial of ...
Add to ORKG