A fast algorithm for determining the minimal polynomial and linear complexity of a upn-periodic sequence over a finite field Fq is given.Let p,q,and u be distinct primes,q a primitive root modulo p2,m the smallest positive integer such that qm≡1 mod u,and gcd(m,p(p-1))=1.An algorithm is used to reduce a periodic upn sequence over Fq to several pn-periodic sequences over Fq(ζ),where ζ is a u-th primitive root of unity,and an algorithm proposed by Xiao et al.is employed to obtain the minimal polynomial of each pn-periodic sequence.
In this paper, we construct some families of strongly regular graphs on finite fields by using unions of cyclotomic classes and index 2 Gauss sums. New infinite families of strongly regular graphs are found.
Let p =ef +1 be an odd prime with positive integers e and f. In this paper, we calculate the values of Gauss periods of order e =3, 4, 6 over a finite field GF(q), where q is a prime with q≠p. As applications, several cyclotomic sequences of order e =3, 4, 6 are employed to construct a number of classes of cyclic codes over GF(q) with prime length. Under certain conditions, the linear complexity and reciprocal minimal polynomials of cyclotomic sequences are calculated, and the lower bounds on the minimum distances of these cyclic codes are obtained.