苏州科技学院学报：自然科学版2012，Vol.29Issue(3)：1-5,5.
二元周期序列4-错误序列的研究
On the 4-error sequence distribution of 2^n-periodic binary sequences
摘要
Abstract
By studying k-linear complexity of binary sequences with period 2^n,it is proposed tion of k-error linear complexity should be converted to finding error sequences with minimal that the computa- Hamming weight. Then the k-error sequences distribution that corresponds with the k-error linear complexity of sequence is dis- cussed. Based on Games-Chan algorithm, for k=4, the counting function on the k-error sequences of 2^n-periodic binary sequences whose linear complexity less than 2^n and the k-error linear complexity are 2^n-1-(2^n+2^i) and 2^n-1- (2^n+2^i)+x is derived. Examples are presented to illustrate the results and checked by computer.关键词
序列密码/线性复杂度/k-错线性复杂度/k-错误序列Key words
stream cipher/linear complexity/k-error linear complexity/k-error sequences分类
信息技术与安全科学引用本文复制引用
周建钦,刘军..二元周期序列4-错误序列的研究[J].苏州科技学院学报：自然科学版,2012,29(3):1-5,5.基金项目
浙江省自然科学基金资助项目 （）
