确定周期为p^n的二元序列的k-错线性复杂度的一个算法

An algorithm for determining the k- error linear complexity of a binary sequence with period p^n

本文给出了确定周期为pn 的二元序列的k -错线性复杂度的一个算法 ,这里p为素数 ,2为模p2

An algorithm is presented for determining the k error linear complexity of a binary sequence with period p n,where p is a prime and 2 is a primitive root(mod p 2)