In this short paper we give a generalization of the two criterion in (4),namely:The first is a necessary and sufficient condition for a polynomial f(x) of coefficients in a field F to be divisible by x^n -1. The second is a necessary and sufficient condition for a polynomial f(x) of coefficients in a field F to be divisible by the cyclotomic polynomial Qp(x) for a prime number p.In addition to these two criterion, we introduce some consequences. An important application of these two criteria is to generate good detecting criteria for error-correcting codes
Consider a maximum-length shift-register sequence generated by a primitive polynomial f over a finit...
AbstractConditions for divisibility of class numbers of algebraic number fields by prime powers are ...
Let q be a prime power and let be a finite field with q elements. This paper discusses the explicit ...
This note describes an algorithm for determining whether a given polynomial f(x) 2 Z[x] has a cyclot...
As a goal of developing alternative algorithm on division of polynomials whose dividend is and the ...
Division of polynomials has fundamental importance in algorithmic algebra, and is commonly encounter...
An algorithm is described that determines whether a given polynomial with integer coefficients has a...
The factors of polynomials of the form x^n-1, called cyclotomic polynomials, have various properties...
We exhibit a deterministic algorithm for factoring polynomials in one variable over finite fields. I...
AbstractThe aim of this paper is to describe two new factorization algorithms for polynomials. The f...
In this paper, we examine a natural question concerning the divisors of the polynomial x n -1: “How ...
The aim of this paper is to describe two new factorization algorithms for polynomials. The first fac...
AbstractWe exhibit a deterministic algorithm for factoring polynomials in one variable over finite f...
This paper is an exploration of the synthetic division in compact form. The main goal was to develop...
this paper, we continue this line of research for deterministic polynomial time algorithms under ERH...
Consider a maximum-length shift-register sequence generated by a primitive polynomial f over a finit...
AbstractConditions for divisibility of class numbers of algebraic number fields by prime powers are ...
Let q be a prime power and let be a finite field with q elements. This paper discusses the explicit ...
This note describes an algorithm for determining whether a given polynomial f(x) 2 Z[x] has a cyclot...
As a goal of developing alternative algorithm on division of polynomials whose dividend is and the ...
Division of polynomials has fundamental importance in algorithmic algebra, and is commonly encounter...
An algorithm is described that determines whether a given polynomial with integer coefficients has a...
The factors of polynomials of the form x^n-1, called cyclotomic polynomials, have various properties...
We exhibit a deterministic algorithm for factoring polynomials in one variable over finite fields. I...
AbstractThe aim of this paper is to describe two new factorization algorithms for polynomials. The f...
In this paper, we examine a natural question concerning the divisors of the polynomial x n -1: “How ...
The aim of this paper is to describe two new factorization algorithms for polynomials. The first fac...
AbstractWe exhibit a deterministic algorithm for factoring polynomials in one variable over finite f...
This paper is an exploration of the synthetic division in compact form. The main goal was to develop...
this paper, we continue this line of research for deterministic polynomial time algorithms under ERH...
Consider a maximum-length shift-register sequence generated by a primitive polynomial f over a finit...
AbstractConditions for divisibility of class numbers of algebraic number fields by prime powers are ...
Let q be a prime power and let be a finite field with q elements. This paper discusses the explicit ...