Estimate of 4-adic complexity of unified quaternary sequences of length $ 2p $

Abstract

<p style='text-indent:20px;'>We derive the 4-adic complexity of unified quaternary sequences with period <inline-formula><tex-math id="M2">\begin{document}$ 2p $\end{document}</tex-math></inline-formula>. These sequences with good autocorrelation properties are proposed by Ke et al. in 2020. We estimate the 4-adic complexity of aforementioned sequences and show that any of them has high 4-adic complexity, which is good enough to resist the attack of the rational approximation algorithm.</p>