Symmetric 4-adic complexity of quaternary sequences with low autocorrelation and period $ pq $

In this paper, we investigate some quaternary sequences with low autocorrelation and period $ pq where p q are two odd distinct primes. These constructed by interleaving the cyclotomic of according to quadratic residues respect $. We estimate symmetric 4-adic complexity considered show that they have a sufficiently large effectively resist attack rational approximation algorithm.