The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
From MaRDI portal
Publication:1699262
DOI10.1007/s12095-017-0233-xzbMath1387.94061OpenAlexW2624155812MaRDI QIDQ1699262
Qiang Wang, Yuhua Sun, Tongjiang Yan
Publication date: 19 February 2018
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-017-0233-x
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Random number generation in numerical analysis (65C10)
Related Items (10)
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 ⋮ On the 2-adic complexity of cyclotomic binary sequences with period \(p^2\) and \(2p^2\) ⋮ The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude ⋮ Binary periodic sequences with 2-level autocorrelation values ⋮ Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products ⋮ 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
- Unnamed Item
- Unnamed Item
- Divisible difference sets, relative difference sets and sequences with ideal autocorrelation
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
- New cyclic difference sets with Singer parameters constructed from \(d\)-homogeneous functions
- The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation
- Binary sequences with optimal autocorrelation
- Feedback shift registers, 2-adic span, and combiners with memory
- 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
- The Linear Complexity of Whiteman's Generalized Cyclotomic Sequences of Period $p^{m+1}q^{n+1}$
- GMW sequences (Corresp.)
- Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
- A New Class of Sequences With Zero or Low Correlation Zone Based on Interleaving Technique
- Cascaded GMW sequences
- Binary pseudorandom sequences of period 2/sup m/-1 with ideal autocorrelation generated by the polynomial z/sup d/+(z+1)/sup d/
- Several classes of binary sequences with three-level autocorrelation
- p-ary unified sequences: p-ary extended d-form sequences with the ideal autocorrelation property
- Linear complexity of de Bruijn sequences-old and new results
- d-form sequences: families of sequences with low correlation values and large linear spans
- $2$-Adic Complexity of Binary $m$-Sequences
- 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
- The Linear Complexity of Some Binary Sequences With Three-Level Autocorrelation
- Shift-register synthesis and BCH decoding
This page was built for publication: The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
