Exponent Sums And Linear Complexity Of Generalized Cyclotomic Sequence

By development of computer science and digital-communication, pseudorandom sequenceshave wide applications in global positioning system, ranging systems, CDMA cellular system and soand. The paper investigates generalized cyclotomic sequences and computes their linear complexity.First, we mainly construct Whiteman generalized cyclotomic sequences with period ofN=pqr and investigate their linear complexity. Second, Edemsikii computes partial exponentsums of cyclotomic sequences of order2and4over GF （2）, obtained the linear complexity of binarycyclotomic sequences, and gave a method to compute the linear complexity of binary generalizedcyclotomic sequences with period ofp^n-1. The paper gives the formula of linear complexity of q-arygeneralized cyclotomic sequences with period ofp^n-1, which is generalized those results from binaryto q-ary generalized cyclotomic sequences.