Linear complexity and k-error linear complexity for 2mpn-periodic binary sequences

被引:0
|
作者
Tan, Lin [1 ]
Qi, Wen-Feng [1 ]
机构
[1] College of Information Engineering, Zhengzhou Information Engineering University, Zhengzhou 450002, China
来源
关键词
Computational complexity - Binary sequences;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The stability of the linear complexity was an important index to scale a sequence's randomicity. For 2mpn-periodic binary sequences, where p was a odd prime and 2 was a primitive root module p2, made use of the tools such as polynomial factorization, provides the bounds of the minimum value k such that the it-error linear complexity is strictly less than the linear complexity.
引用
收藏
页码:44 / 49
相关论文
共 50 条