The 4-adic complexity of quaternary sequences with low autocorrelation and high linear complexity
Feifei Yan, Pinhui Ke, Lingmei Xiao · Advances in Mathematics of Communications · 2024
Recently, Jiang et al. proposed several new classes of quaternary sequences with low autocorrelation and high linear complexity by using the inverse Gray mapping (JAMC, 69 (2023): 689-706). In this paper, we estimate the 4-adic complexity of these quaternary sequences. Our results show that these sequences have high 4-adic complexity to resist the attack of the rational approximation algorithm.