On the Error Linear Complexity Spectrum of Binary 2n-periodic Sequences

摘要：

　　The properties of error linear complexity of binary sequences with period 2n are studied in this paper.Using Games-Chan algorithm as main tool,accurate formulas of the minimum value k for which the k-error linear complexity is strictly less than the first and second error linear complexity are provided respectively.

关键词： Binary sequence Games-Chan algorithm error linear complexity error linear complexity spectrum

作者: Zu-Ling Chang

作者单位: Department of Mathematics Zhengzhou University, Zhengzhou, 450001, P.R.China

会议类型: 国内会议

会议名称: 中国密码学会2012年会

会议地点: 合肥

会议语种:英文

页码: 170-182

在线出版日期: 2012-08-09（万方平台首次上网日期，不代表论文的发表时间）