若干二元周期序列的紧错线性复杂度  

Tight error linear complexity of periodic binary sequences

作　　者：周建钦[1,2] 上官成[2] 赵泽茂[1] 

机构地区：[1]杭州电子科技大学通信工程学院,杭州310018 [2]安徽工业大学计算机学院,安徽马鞍山243002

出　　处：《计算机工程与应用》2011年第10期49-53,共5页Computer Engineering and Applications

基　　金：浙江省自然科学基金No.Y1100318;No.R1090138;上海市信息安全综合管理技术研究重点实验室开放课题(No.AGK20090077)~~

摘　　要：综合线性复杂度、k错线性复杂度、k错线性复杂度曲线和最小错误minerro(rS)的概念,提出m紧错线性复杂度的概念。序列S的m紧错线性复杂度是一个二元组(km,LCm)。序列S的k错线性复杂度曲线的第m个跃变点对应的km值和对应km错线性复杂度LCm,称为序列S的m紧错线性复杂度。通过使用简洁的cost二维结构,给出了周期为2n的二元序列的紧错线性复杂度算法,并证明具有Stamp-Martin模式的线性复杂度算法均可以简单地推广为求紧错线性复杂度的算法。与现有k错线性复杂度算法不同,该算法中省去了原来序列元素的运算。在王-张-肖算法基础上,通过使用cost二维结构,给出了周期为pn的二元序列的紧错线性复杂度算法,其中p是一个素数,2是一个模p2的本原根。Based on the earlier notions of linear complexity,k-error linear complexity,k-error linear complexity profile and minerror,the concept of m-tight error linear complexity is presented to study the stability of the linear complexity of sequences. The m-tight error linear complexity of sequence S is defined as a two tuple （km,LCm）,which is the m-th jump point of the k-error linear complexity profile of sequence S.An algorithm is given for the m-tight error linear complexity of binary sequences with period 2n by using the modified cost different from that used in the Stamp-Martin algorithm.The new algo-rithm is free of computations relating the sequence elements.Based on the Wang-Zhang-Xiao algorithm,an efficient algorithm for computing m-tight error linear complexity of binary sequences with period pn is given,where p is a prime and 2 is a primitive root modulus p2.

关 键 词：周期序列 线性复杂度 K错线性复杂度 m紧错线性复杂度 

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