2~n-周期二元序列的6-错线性复杂度  

The 6-error Linear Complexity of 2n-Periodic Binary Sequences

作　　者：周建钦[1] 剌锋[1] 

机构地区：[1]杭州电子科技大学通信工程学院,浙江杭州310018

出　　处：《杭州电子科技大学学报（自然科学版）》2011年第6期13-16,共4页Journal of Hangzhou Dianzi University：Natural Sciences

基　　金：浙江省自然科学基金资助项目(Y1100318;R1090138)

摘　　要：线性复杂度和k-错线性复杂度是度量密钥流序列的密码强度的重要指标。该文通过研究周期为2n的二元序列线性复杂度,基于Games-Chan算法,讨论了线性复杂度为2n-1的2n-周期二元序列的6-错线性复杂度分布情况。在大多数情况下,给出了对应6-错线性复杂度序列的计数公式,并且指出了参考文献中的一个重要错误。The linear complexity and the k-error linear complexity of a sequence have been used as important measures of keystream sequence strength.By studying linear complexity of binary sequences with period 2n,based on Games-Chan algorithm,6-error linear complexity distribution of 2n-periodic binary sequences with linear complexity 2n-1 is discussed.In most cases,the complete counting functions on the 6-error linear complexity of 2n-periodic binary sequences are presented.As a consequence of these results,an important error in the bibliography is pointed out.

关 键 词：周期序列 线性复杂度 错误线性复杂度 错误线性复杂度分布 

分 类 号：TN918.1[电子电信—通信与信息系统]