The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
From MaRDI portal
Publication:2202907
DOI10.1007/s12095-019-00411-4zbMath1453.94053arXiv1805.01990OpenAlexW2984368896WikidataQ126792510 ScholiaQ126792510MaRDI QIDQ2202907
Tongjiang Yan, Zhixiong Chen, Lianhai Wang, Yuhua Sun
Publication date: 30 September 2020
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.01990
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Sequences (mod (m)) (11B50)
Related Items (8)
2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude ⋮ The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length \(8q\) ⋮ The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude ⋮ On the 2-adic complexity of cyclotomic binary sequences of order three ⋮ Correlation properties of interleaved Legendre sequences and Ding-Helleseth-Lam sequences ⋮ On the 2-adic complexity of cyclotomic binary sequences with period \(p^2\) and \(2p^2\) ⋮ Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\) ⋮ On the 4-adic complexity of the two-prime quaternary generator
Cites Work
- A general construction of binary interleaved sequences of period \(4{N}\) with optimal autocorrelation
- Feedback shift registers, 2-adic span, and combiners with memory
- 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
- 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
- Several classes of binary sequences with three-level autocorrelation
- Almost difference sets and their sequences with optimal autocorrelation
- Theory and applications of q-ary interleaved sequences
- New Constructions of Binary Sequences With Optimal Autocorrelation Value/Magnitude
- On the Linear Complexity of Binary Sequences of Period $4N$ With Optimal Autocorrelation Value/Magnitude
- The Linear Complexity of Binary Sequences With Optimal Autocorrelation
- New Classes of Balanced Quaternary and Almost Balanced Binary Sequences With Optimal Autocorrelation Value
This page was built for publication: The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude