finite field;
primitive polynomial;
linear recurring sequence;
D O I:
10.1016/j.ffa.2007.01.002
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
A characterization of primitive polynomials, among irreducible polynomials, over a finite field is established. Such characterization is determined by the number of nonzero terms in certain quotient of polynomials. The proof, which is a modification of the one discovered by Fitzgerald in 2003 yet revealing more general structure, is based principally on counting the number of occurrences of elements in a linear recurring sequence over a finite field. (c) 2007 Elsevier Inc. All rights reserved.