线性复杂度-2017年11月.PPTVIP

线性复杂度 Linear Complexity of a Sequence with Period p^n Over GF(q) 引理 证明continue Algorithm Example Linear complexity Games R A and Chan A H. A fast algorithm for determining the complexity of a binary sequence with period 2^n. IEEE Transactions on Information Theory, 1983, 29 (1):144-146. Wei S, Xiao G, Chen Z. A fast algorithm for determining the minimal polynomial of a sequence with period 2p^n over GF(q). IEEE Transactions on Information Theory, 2002, 48(10):2754–2757. Xiao G, Wei S, Lam K Y, and Imamura K. A fast algorithm for determining the linear complexity of a sequence with period p^