2000 character limit reached
On the 4-Adic Complexity of Quaternary Sequences with Ideal Autocorrelation (2107.03574v2)
Published 8 Jul 2021 in cs.IT and math.IT
Abstract: In this paper, we determine the 4-adic complexity of the balanced quaternary sequences of period $2p$ and $2(2n-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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
