Using the fact that the factorization of x - 1 over GF（2） is especially explicit. we completely establish the distributions and the expected values of the linearcomplexity and the k-error linear complexity of the N...
详细信息
Using the fact that the factorization of x - 1 over GF（2） is especially explicit. we completely establish the distributions and the expected values of the linearcomplexity and the k-error linear complexity of the N-periodic sequences respectively, where N is an odd prime and 2 is a primitive root modulo N. The results show that there are a large percentageof sequences with both the linearcomplexity and the k-error linear complexity not less than N, quite close to their maximum possible values.
暂无评论