FAMILIES OF p-ARY SEQUENCES WITH LOW CORRELATION AND LARGE LINEAR COMPLEXITY  

作　　者：CAI Han ZENG Xiangyong HU Lei 

机构地区：[1]Faculty of Mathematics and Statistics,Hubei University [2]State Key Laboratory of Information Security,Institute of Information Engineering,Chinese Academy of Sciences

出　　处：《Journal of Systems Science & Complexity》2014年第6期1305-1319,共15页系统科学与复杂性学报（英文版）

基　　金：supported by the National Natural Science Foundation of China under Grant No.61170257;supported by the National Key Basic Research Program of China under Grant No.2013CB834203;the National Science Foundation of China under Grant Nos.10990011 and 61070172;the Strategic Priority Research Program of Chinese Academy of Sciences under Grant No.XDA06010702

摘　　要：This paper generalizes a method of generating shift sequences in the interleaved construction proposed by Gong.With the new shift sequences,some new families of p-ary sequences with desired properties can be obtained.A lower bound on the number of new families of binary sequences is also established.

关 键 词：Auto-correlation CROSS-CORRELATION linear complexity low correlation p-ary sequence. 

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