Linear complexity of quaternary sequences with odd period and low autocorrelation  

作　　者：KE Pin-hui LIN Chang-lu ZHANG Sheng-yuan 

机构地区：[1]Fujian Provincial Key Laboratory of Network Security and Cryptology,Fujian Normal University

出　　处：《The Journal of China Universities of Posts and Telecommunications》2014年第5期89-93,共5页中国邮电高校学报（英文版）

基　　金：supported by the National Natural Science Foundation of China (61102093);the Joint Funds of the National Natural Science Foundation of China (U1304604);the Fujian Normal University Innovative Research Team (IRTL 1207)

摘　　要：Equivalence between two classes of quaternary sequences with odd period and best known autocorrelation are proved. A lower bound on the linear complexity of these sequences is presented. It is shown that the quaternary sequences have large linear complexity to resist Reeds and Sloane algorithm attack effectively.Equivalence between two classes of quaternary sequences with odd period and best known autocorrelation are proved. A lower bound on the linear complexity of these sequences is presented. It is shown that the quaternary sequences have large linear complexity to resist Reeds and Sloane algorithm attack effectively.

关 键 词：quaternary sequences linear complexity CYCLOTOMY 

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