The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude

2020/01/21 by Yuhua Sun, Sun, Yuhua, Tongjiang Yan +2
Computer Science · Engineering · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2001.07393

openalex publication_date 2020/01/21 · openalex created_date 2020/01/30 · openalex updated_date 2026/07/28

Abstract

In 2008, a class of binary sequences of period N=4(2^k-1)(2^k+1) with optimal autocorrelation magnitude has been presented by Yu and Gong based on an m-sequence, the perfect sequence (0,1,1,1) of period 4 and interleaving technique. In this paper, we study the 2-adic complexities of these sequences. Our results show that they are larger than N-2\lceillog₂N\rceil+4 (which is far larger than N/2) and could attain the maximum value N if suitable parameters are chosen, i.e., the 2-adic complexity of this class of interleaved sequences is large enough to resist the Rational Approximation Algorithm.

Related

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