周期序列的k错线性复杂度(k-LC)被定义为改变周期序列中至多k(0≤k≤N)位后,得到所有序列线性复杂度中最小线性复杂度。m(s)表示一个序列的k-LC严格小于线性复杂度的最小k值。讨论了上周期为3npm序列的k错线性复杂度,这里p是奇素数,并且3是一个模p2的本原根,进一步讨论了序列线性复杂度和m(s)之间的关系。 The k-linear complexity (k-LC) of a periodic sequence is defined as the minimum linear complexity in the linear complexity of all sequences after changing at most k (0≤k≤N) bits in the periodic sequence. m (s) denotes the minimum k value for a sequence whose k-LC is strictly less than the linear complexity. The k-error linear complexity of the 3npm sequence in the previous period is discussed, where p is an odd prime and 3 is a primitive root of a mod p2, which further discusses the relationship between the sequence linear complexity and m (s).