The linear complexity of a class of binary sequences with optimal autocorrelation
From MaRDI portal
Publication:1671646
DOI10.1007/s10623-018-0456-7zbMath1408.94923arXiv1708.05480OpenAlexW2962895682MaRDI QIDQ1671646
Publication date: 6 September 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.05480
Related Items
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 ⋮ Correlation properties of interleaved Legendre sequences and Ding-Helleseth-Lam sequences ⋮ The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude ⋮ Some new classes of quaternary sequences with low autocorrelation property via two binary cyclotomic sequences ⋮ Binary periodic sequences with 2-level autocorrelation values
Cites Work
- Unnamed Item
- Unnamed Item
- Binary sequences with optimal autocorrelation
- The stability theory of stream ciphers
- New optimal binary sequences with period \(4p\) via interleaving Ding-Helleseth-Lam sequences
- New Binary Sequences With Optimal Autocorrelation Magnitude
- A class of balanced binary sequences with optimal autocorrelation properties
- Several classes of binary sequences with three-level autocorrelation
- Almost difference sets and their sequences with optimal autocorrelation
- 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
- Shift-register synthesis and BCH decoding
