|| On the 4-Adic Complexity of Quaternary Sequences of Period 2p with Ideal Autocorrelation
||Minghui Yang, Institute of Information Engineering, Chinese Academy of Sciences, China; Shiyuan Qiang, China Agricultural University, China; Keqin Feng, Tsinghua University, China; Dongdai Lin, Institute of Information Engineering, Chinese Academy of Sciences, China|
||D4-S5-T2: Sequences III
||Thursday, 15 July, 23:20 - 23:40
||Thursday, 15 July, 23:40 - 00:00
In this paper, we study the 4-adic complexity of two classes of quaternary sequences of period 2p with ideal autocorrelation defined by Kim et al. (ISIT, 2009). Our results show that the 4-adic complexity of these two kinds of quaternary sequences is large enough to resist the attack of the rational approximation algorithm.