2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude
From MaRDI portal
Publication:2121016
DOI10.1007/s12095-021-00498-8zbMath1485.94046OpenAlexW3183814471MaRDI QIDQ2121016
Publication date: 1 April 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00498-8
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (1)
Cites Work
- Unnamed Item
- Binary sequences 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
- The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
- 2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences
- 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
- New Binary Sequences With Optimal Autocorrelation Magnitude
- 2-Adic shift registers
- Almost difference sets and their sequences with optimal autocorrelation
- On the 2-Adic Complexity of the Two-Prime Generator
- Autocorrelation values of generalized cyclotomic sequences of order two
- Theory and applications of q-ary interleaved sequences
- New Constructions of Binary Sequences With Optimal Autocorrelation Value/Magnitude
- On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences
- On the Linear Complexity of Binary Sequences of Period $4N$ With Optimal Autocorrelation Value/Magnitude
- A family of difference sets
This page was built for publication: 2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude