The 4-adic complexity of quaternary sequences with low autocorrelation and high linear complexity

2024/01/06 by Feifei Yan, Yan, Feifei, Pinhui Ke +3
Computer Science · #Cellular Automata and Applications #Coding theory and cryptography #Cryptography and Security (cs.CR) #FOS: Computer and information sciences

paper · pdf · doi:10.48550/arxiv.2401.03204

openalex publication_date 2024/01/06 · openalex created_date 2024/01/13 · openalex updated_date 2026/07/28

Abstract

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 large 4-adic complexity to resist the attack of the rational approximation algorithm.

Related

• On the 4-Adic Complexity of Quaternary Sequences with Ideal Autocorrelation
• The 4-Adic Complexity of Interleaved Quaternary Sequences of Even Length with Optimal Autocorrelation
• 4-Adic Complexity of Interleaved Quaternary Sequences
• The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
• On the 2-adic complexity of a class of binary sequences of period 4p with optimal autocorrelation magnitude