The 4-Adic Complexity of Quaternary Sequences of Even Period With Ideal Autocorrelation

The purpose of this paper is to determine the 4-adic complexity of the balanced quaternary sequences of period 2(2
ⁿ
−1) with ideal autocorrelation defined by Jang et al. (ISIT, pp. 278-281, 2009). Results show that the 4-adic complexity of such sequences is large enough to resist the attack of the rational approximation algorithm for feedback with carry shift registers.