共查询到20条相似文献,搜索用时 15 毫秒
1.
It is well known that the Stickelberger–Swan theorem is very important for determining the reducibility of polynomials over a binary field. Using this theorem the parity of the number of irreducible factors for some kinds of polynomials over a binary field, for instance, trinomials, tetranomials, self-reciprocal polynomials and so on was determined. We discuss this problem for Type II pentanomials, namely xm+xn+2+xn+1+xn+1F2[x] for even m. Such pentanomials can be used for the efficient implementation of multiplication in finite fields of characteristic two. Based on the computation of the discriminant of these pentanomials with integer coefficients, we will characterize the parity of the number of irreducible factors over F2 and establish necessary conditions for the existence of this kind of irreducible pentanomials.Our results have been obtained in an experimental way by computing a significant number of values with Mathematica and extracting the relevant properties. 相似文献
2.
3.
4.
Anuradha Sharma Gurmeet K. Bakshi Madhu Raka 《Finite Fields and Their Applications》2007,13(4):1086-1095
Let m be a positive integer and q be an odd prime power. In this paper, the weight distributions of all the irreducible cyclic codes of length 2m over Fq are determined explicitly. 相似文献
5.
6.
《Discrete Mathematics》2019,342(12):111603
7.
S. Ugolini 《Discrete Mathematics》2013,313(22):2656-2662
In this paper we construct an infinite sequence of binary irreducible polynomials starting from any irreducible polynomial . If is of degree , where is odd and is a nonnegative integer, after an initial finite sequence of polynomials , with , the degree of is twice the degree of for any . 相似文献
8.
9.
Toshihiro Kumada Hannes Leeb Yoshiharu Kurita Makoto Matsumoto. 《Mathematics of Computation》2002,71(239):1337-1338
We report an error in our previous paper [#!K1!#], where we announced that we listed all the primitive trinomials over of degree 859433, but there is a bug in the sieve. We missed the primitive trinomial and its reciprocal, as pointed out by Richard Brent et al. We also report some new primitive pentanomials.
10.
Toshihiro Kumada Hannes Leeb Yoshiharu Kurita Makoto Matsumoto. 《Mathematics of Computation》2000,69(230):811-814
All primitive trinomials over with degree 859433 (which is the 33rd Mersenne exponent) are presented. They are and its reciprocal. Also two examples of primitive pentanomials over with degree 86243 (which is the 28th Mersenne exponent) are presented. The sieve used is briefly described.
11.
In this paper we obtained the formula for the number of irreducible polynomials with degree n over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al. (2003) [2]. 相似文献
12.
13.
We derive explicit factorizations of generalized cyclotomic polynomials of order and generalized Dickson polynomials of the first kind of order over finite field . 相似文献
14.
Simeon Ball 《Journal of Combinatorial Theory, Series A》2008,115(3):505-516
A three-dimensional analogue of the classical direction problem is proposed and an asymptotically sharp bound for the number of directions determined by a non-planar set in AG(3,p), p prime, is proved. Using the terminology of permutation polynomials the main result states that if there are more than pairs with the property that f(x)+ag(x)+bx is a permutation polynomial, then there exist elements c,d,e∈Fp with the property that f(x)=cg(x)+dx+e. 相似文献
15.
16.
17.
18.
After a brief review of the existing results on permutation binomials of finite fields, we introduce the notion of equivalence among permutation binomials (PBs) and describe how to bring a PB to its canonical form under equivalence. We then focus on PBs of of the form , where n and d are positive integers and . Our contributions include two nonexistence results: (1) If q is even and sufficiently large and , then is not a PB of . (2) If , q is sufficiently large and , then is not a PB of under certain additional conditions. (1) partially confirms a recent conjecture by Tu et al. (2) is an extension of a previous result with . 相似文献
19.
We investigate Fuglede's spectral set conjecture in the special case when the set in question is a union of finitely many unit intervals in dimension 1. In this case, the conjecture can be reformulated as a statement about multiplicative properties of roots of associated with the set polynomials with (0,1) coefficients. Let be an N-term polynomial. We say that {θ1,θ2,…,θN−1} is an N-spectrum for A(x) if the θj are all distinct and