2-adic complexity of binary sequences with interleaved structure
From MaRDI portal
Publication:2011478
DOI10.1016/j.ffa.2014.09.009zbMath1368.94080OpenAlexW2036676363MaRDI QIDQ2011478
Hai Xiong, Chao Li, Longjiang Qu
Publication date: 3 August 2017
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2014.09.009
binary sequenceinterleaved sequence2-Adic complexityinterleaved structureLCZ sequenceoptimal autocorrelation sequence
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 ⋮ The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation ⋮ The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude ⋮ A lower bound on the 2-adic complexity of the modified Jacobi sequence ⋮ 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four ⋮ Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products
Cites Work
- Unnamed Item
- Unnamed Item
- Perfect and almost perfect sequences
- Feedback shift registers, 2-adic span, and combiners with memory
- 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 Design of Low-Correlation Zone Sequence Sets
- On the $2$-Adic Complexity and the $k$-Error $2$-Adic Complexity of Periodic Binary Sequences
- A New Class of Sequences With Zero or Low Correlation Zone Based on Interleaving Technique
- New Binary Sequences With Optimal Autocorrelation Magnitude
- On the existence of cyclic Hadamard difference sets
- 2-Adic shift registers
- Almost difference sets and their sequences with optimal autocorrelation
- New designs for signal sets with low cross correlation, balance property, and large linear span: GF(p) case
- Theory and applications of q-ary interleaved sequences
- New Constructions of Binary Sequences With Optimal Autocorrelation Value/Magnitude
- $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
- Binary Almost-Perfect Sequence Sets
This page was built for publication: 2-adic complexity of binary sequences with interleaved structure