周期为N＝n2^v的序列线性复杂度的快速算法

A FAST ALGORITHM FOR DETERMING THELINEAR COMPLEXITY OF A PSEUDO-RANDOM SEQUENCE WITH PERIODIC n2v

文中利用广义离散傅里叶变换对GF(2)上周期为N=n2v(gcd(n,2)=1)序列进行了研究,给出了求周期为N=n2v的序列线性复杂度的快速算法,并得到了关于GF(2)上多项式的Hasse导数的一些新结果.

A generalized discrete Fourier transfom is used to give a fast algorithm for determing the linear complexity of a pseudo-random sequence with periodic n2v, and a new conclusion of Hasse derivatives of polynoimial on GF(2) are proposed.