The 4-Adic Complexity of Interleaved Quaternary Sequences of Even Length with Optimal Autocorrelation (2209.10279v1)
Abstract: Su et al. proposed several new classes of quaternary sequences of even length with optimal autocorrelation interleaved by twin-prime sequences pairs, GMW sequences pairs or binary cyclotomic sequences of order four in \cite{S1}. In this paper, we determine the 4-adic complexity of these quaternary sequences with period $2n$ by using correlation function and the "Gauss periods" of order four and "quadratic Gauss sums" on finite field $\mathbb{F}n$ and valued in $\mathbb{Z}{*}{4{2n}-1}$. Our results show that they are safe enough to resist the attack of the rational approximation algorithm.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.