| 二元周期序列4-错误序列的研究 |
| |
| 引用本文： | 周建钦,刘军.二元周期序列4-错误序列的研究[J].苏州科技学院学报(自然科学版),2012,29(3):1-5. |
| |
| 作者姓名： | 周建钦 刘军 |
| |
| 作者单位： | 1. 杭州电子科技大学通信工程学院,浙江杭州310018 安徽工业大学计算机学院,安徽马鞍山243032
2. 杭州电子科技大学通信工程学院,浙江杭州,310018 |
| |
| 基金项目： | 浙江省自然科学基金资助项目(Y1100318,R1090138) |
| |
| 摘 要： | 通过将周期为2n的二元序列的k-错线性复杂度的计算转化为求Hamming重量最小的错误序列的方法,研究序列的k-错线性复杂度的分布情况,讨论了序列不同k-错线性复杂度条件下对应的k-错误序列的分布情况。基于Games-Chan算法,给出了线性复杂度小于2n的2n周期二元序列的4-错线性复杂度分别为2n-1-(2m+2j)和2n-1-(2m+2j)+x情况下的4-错误序列的计数公式。同时,给出实例并使用计算机进行验证。
|
| 关 键 词： | 序列密码 线性复杂度 k-错线性复杂度 k-错误序列 |
On the 4-error sequence distribution of 2~n-periodic binary sequences |
| |
| ZHOU Jianqin,LIU Jun.On the 4-error sequence distribution of 2~n-periodic binary sequences[J].Journal of University of Science and Technology of Suzhou,2012,29(3):1-5. |
| |
| Authors: | ZHOU Jianqin LIU Jun |
| |
| Institution: | 1 (1.Telecommunication School,Hangzhou Dianzi University,Hangzhou 310018,China;2.Computer Science School,Anhui University of Technology,Ma’anshan 243032,China) |
| |
| Abstract: | By studying k-linear complexity of binary sequences with period 2n,it is proposed that the computation of k-error linear complexity should be converted to finding error sequences with minimal Hamming weight.Then the k-error sequences distribution that corresponds with the k-error linear complexity of sequence is discussed.Based on Games-Chan algorithm,for k=4,the counting function on the k-error sequences of 2n-periodic binary sequences whose linear complexity less than 2n and the k-error linear complexity are 2n-1-(2m+2j) and 2n-1-(2m+2j)+x is derived.Examples are presented to illustrate the results and checked by computer. |
| |
| Keywords: | stream cipher linear complexity k-error linear complexity k-error sequences |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
