机构地区: 空军导弹学院
出 处: 《通信学报》 1997年第2期20-28,共9页
摘 要: 本文运用指数集的概念,得到了任意有限域GF(q)(q=pm)上L级m-序列的多项式序列的线性复杂度,并导出了一类可控序列线性复杂度的上界,这个上界很可能是紧上界。当域特征p=2时,这类序列线性复杂度的上界为L+12[(L+1)m-1],下界为[(L+1)m-1]。 With the concept of exponent set introduced, the complexity of polynomial sequences of an m sequence of degree L over any finite field GF(q) (q=p m) is obtained, and an upper bound of the complexity of a class of controllable sequence is derived which appears to be the tight one. In the case of field characteristic p=2, this class of sequence has an upper bound L+12[(L+1) m-1] and a lower bound [(L+1) m-1] of complexity.