Galois环上的一类具有极大线性复杂度和最佳相关性的GMW序列  

GMW Sequences over Galois Rings with Large Linear Complexities and Optimal Correlation

作　　者：孙霓刚[1,2] 秦云[3] 

机构地区：[1]华东理工大学计算机科学与工程系,上海200237 [2]中国科学院研究生院信息安全国家重点实验室,北京100049 [3]江南大学理学院,江苏无锡214122

出　　处：《华东理工大学学报（自然科学版）》2009年第2期256-260,共5页Journal of East China University of Science and Technology

摘　　要：构造了一类在特征为素数平方的Galois环上的GMW序列族,推广了Udaya和Siddiqi的工作。证明了该序列族具有大的序列周期和最佳相关性,其最佳相关性用Welch下界来衡量。同时利用离散傅里叶变换对序列的线性复杂度进行了估计,结果表明这类序列具有非常大的线性复杂度。A new family of GMW sequences over an arbitrary Galois ring with the characteristic of p2 is constructed, which generalizes the related result of Udaya and Siddiqi for the case that the Galois ring is Z4. Such GMW sequences have large period and optimal correlation in terms of Welch＇s lower bound. Utilizing the discrete Fourier transform, both the upper and lower bounds on the linear complexities of this family of GMW sequences are investigated. The result shows that such sequences have large linear complexities.

关 键 词：GALOIS环 GMW序列 相关性 线性复杂度 Welch下界 

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