Improvements on the 4-adic complexity of a class of quaternary sequences

Yang and Ke proposed a new class of quaternary sequences with low autocorrelation of period pq by using the inverse Gray mapping and the pair of two generalized cyclotomic sequences (Cryptography and Communications, vol. 3, pp. 55-64, 2011). In this paper, we aim to study and determine the 4-adic complexity of this class of quaternary sequences, and our results show that the 4-adic complexity of this class of quaternary sequences is quite large, and it can reach the maximum in particular cases.