In the Galois fields GF(2n), a polynomial basis with a small number of trace-one elements is desirable for its convenience in computing. To find new irreducible polynomials g(x) over GF(2) with this property, we research into the auxiliary polynomial f(x)=(x+1)g(x) with roots {1,α1,α2,…,αn}, such that the symmetric polynomials sk=1+α1k+α2k+⋯+αnk are relative to the symmetric polynomials of g(x). We introduce a new class of polynomials with the number “1” occupying most of the values in its sk. This indicates that the number “0” occupies most of the values of the traces of the elements {α1,α2,…,αn}. This new class of polynomial gives us an indirect way to find irreducible polynomials having a small number of trace-one elements in their polyn...
AbstractLet ƒ(x) ∈ K[x] be a polynomial and x1,..., xn its roots. By assuming conditions on the Galo...
This report lists the primitive polynomials over GF(3) of degree 2 through 11. These polynomials wer...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
AbstractFor an even positive integer n, we determine formulas for the number of irreducible polynomi...
AbstractFor an odd positive integer n, we determine formulas for the number of irreducible polynomia...
AbstractThis paper presents procedures for constructing irreducible polynomials over GF(2s) with lin...
Abstract: Problem Statement: Let K is the splitting field of a polynomial f(x) over a field F and αn...
Computing the Galois group of the splitting field of a given polynomial with integer coefficients ov...
Computing the Galois group of the splitting field of a given polynomial with integer coeffi- cients ...
In this paper we have obtained some results regarding the number of roots and the irreducibility pro...
We consider polynomials p(x) over the 2-element field F2. If p(x) of degree n is irreducible, then a...
We consider several simple combinatorial problems and discuss different ways to express them using p...
Methods of generating irreducible polynomials from a given minimal polynomial are known. However, wh...
In this paper a new approach to the problem of generating irreducible polynomials from a given minim...
AbstractLet ƒ(x) ∈ K[x] be a polynomial and x1,..., xn its roots. By assuming conditions on the Galo...
AbstractLet ƒ(x) ∈ K[x] be a polynomial and x1,..., xn its roots. By assuming conditions on the Galo...
This report lists the primitive polynomials over GF(3) of degree 2 through 11. These polynomials wer...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
AbstractFor an even positive integer n, we determine formulas for the number of irreducible polynomi...
AbstractFor an odd positive integer n, we determine formulas for the number of irreducible polynomia...
AbstractThis paper presents procedures for constructing irreducible polynomials over GF(2s) with lin...
Abstract: Problem Statement: Let K is the splitting field of a polynomial f(x) over a field F and αn...
Computing the Galois group of the splitting field of a given polynomial with integer coefficients ov...
Computing the Galois group of the splitting field of a given polynomial with integer coeffi- cients ...
In this paper we have obtained some results regarding the number of roots and the irreducibility pro...
We consider polynomials p(x) over the 2-element field F2. If p(x) of degree n is irreducible, then a...
We consider several simple combinatorial problems and discuss different ways to express them using p...
Methods of generating irreducible polynomials from a given minimal polynomial are known. However, wh...
In this paper a new approach to the problem of generating irreducible polynomials from a given minim...
AbstractLet ƒ(x) ∈ K[x] be a polynomial and x1,..., xn its roots. By assuming conditions on the Galo...
AbstractLet ƒ(x) ∈ K[x] be a polynomial and x1,..., xn its roots. By assuming conditions on the Galo...
This report lists the primitive polynomials over GF(3) of degree 2 through 11. These polynomials wer...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...