周期为p^(n+1)的GF(q)上广义分圆序列的线性复杂度

The linear complexity of p^(n+1)-periodic generalized cyclotomic sequence over GF(q)

主要研究周期为pn+1的q元域上广义分圆序列的线性复杂度,即把二元域上Edemskii的研究结果推广到一般GF(q)上。这里利用分圆数和部分指数和来给出具体的关于线性复杂度的计算公式。

This paper mainly researched the linear complexity of pn＋1-periodic generalized cyclotomic sequences,which generalize Edemskii＇s results which is mentioned in the first reference from binary field to GF（q）.In this paper,cyclotomic number and sums of partial index number will be used to give concrete computation equation of the linear complexity.