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

DOI10.1007/S10623-020-00841-9zbMATH Open1470.94070arXiv2001.07393OpenAlexW3124455477MaRDI QIDQ831160FDOQ831160

Authors: Yuhua Sun, Tongjiang Yan, Qiuyan Wang 

Publication date: 10 May 2021

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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-2lceilmathrm{log}_{2}Nceil+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.

Full work available at URL: https://arxiv.org/abs/2001.07393

Recommendations

• The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
• 2-adic complexity of binary sequences with interleaved structure
• 2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude
• Study of 2-adic complexity of a class of binary sequences with optimal autocorrelation values
• The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length \(8q\)

zbMATH Keywords

\(m\)-sequenceinterleaved sequence2-adic complexityoptimal autocorrelation magnitude

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Sequences (mod (m)) (11B50)

Cites Work

• Feedback shift registers, 2-adic span, and combiners with memory
• Theory and applications of q-ary interleaved sequences
• New Binary Sequences With Optimal Autocorrelation Magnitude
• Almost difference sets and their sequences with optimal autocorrelation
• New Constructions of Binary Sequences With Optimal Autocorrelation Value/Magnitude
• A general construction of binary interleaved sequences of period \(4{N}\) with optimal autocorrelation
• New Classes of Balanced Quaternary and Almost Balanced Binary Sequences With Optimal Autocorrelation Value
• On the Linear Complexity of Binary Sequences of Period $4N$ With Optimal Autocorrelation Value/Magnitude
• The linear complexity of a class of binary sequences with optimal autocorrelation
• The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
• New optimal binary sequences with period \(4p\) via interleaving Ding-Helleseth-Lam sequences
• 2-adic complexity of binary sequences with interleaved structure
• The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
• Comments on “A New Method to Compute the 2-Adic Complexity of Binary Sequences”
• A New Method to Compute the 2-Adic Complexity of Binary Sequences
• On the 2-Adic Complexity of the Two-Prime Generator

Cited In (6)

• On the symmetric 2-adic complexity of periodic binary sequences
• 2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude
• Symmetric 2-adic complexity of Tang-Gong interleaved sequences from generalized GMW sequence pair
• The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length \(8q\)
• 2-adic complexity of binary sequences with interleaved structure
• The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude

This page was built for publication: The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831160)