On the 4-Adic Complexity of Quaternary Sequences with Ideal Autocorrelation

2021/07/08 by Yang, Minghui, Qiang, Shiyuan, Jing, Xiaoyan +2
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2107.03574

Abstract

In this paper, we determine the 4-adic complexity of the balanced quaternary sequences of period 2p and 2(2ⁿ-1) with ideal autocorrelation defined by Kim et al. (ISIT, pp. 282-285, 2009) and Jang et al. (ISIT, pp. 278-281, 2009), respectively. Our results show that the 4-adic complexity of the quaternary sequences defined in these two papers is large enough to resist the attack of the rational approximation algorithm.

Related

• 4-Adic Complexity of Interleaved Quaternary Sequences
• The 4-Adic Complexity of Interleaved Quaternary Sequences of Even Length with Optimal Autocorrelation
• The 4-adic complexity of quaternary sequences with low autocorrelation and high linear complexity
• The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude
• On the 2-adic complexity of a class of binary sequences of period 4p with optimal autocorrelation magnitude