电子学报2011，Vol.39Issue(12)：2914-2920,7.
二元周期序列的4-错线性复杂度
The 4-Error Linear Complexity of Binary Periodic Sequences
摘要
Abstract
The k-error linear complexity is one of the important measures for assessing the pseudorandom properties of sequences . For binary sequences with period a power of 2, of which the first decreasing point of the linear complexity is 4, the possible values of the 4-error linear complexity and the number of sequences with given 4-error linear complexity are established based on the Games-Chan algorithm.Moreover, the expected value of the 4-error linear complexity is also provided.The results show that the 4-error linear complexity is close to the linear complexity.关键词
序列密码/周期序列/线性复杂度/k-错线性复杂度Key words
stream cipher/periodic sequences/linear complexity/ k-error linear complexity分类
信息技术与安全科学引用本文复制引用
皮飞,戚文峰..二元周期序列的4-错线性复杂度[J].电子学报,2011,39(12):2914-2920,7.基金项目
国家自然科学基金(No.60833008,No.61070178) （No.60833008,No.61070178）
