Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
From MaRDI portal
Publication:2311428
DOI10.1007/s12095-018-0324-3zbMath1459.94090OpenAlexW2888997144MaRDI QIDQ2311428
Xiangyong Zeng, Zibi Xiao, Yupeng Jiang, Chaoyun Li
Publication date: 10 July 2019
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-018-0324-3
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Special sequences and polynomials (11B83)
Related Items (2)
On finite length nonbinary sequences with large nonlinear complexity over the residue ring \(\mathbb{Z}_m\) ⋮ Binary sequences derived from differences of consecutive quadratic residues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximate distribution for the maximum order complexity
- Composition of recursions and nonlinear complexity of periodic binary sequences
- Root counting, the DFT and the linear complexity of nonlinear filtering
- Linear complexity of generalized cyclotomic binary sequences of order 2
- Sequences With High Nonlinear Complexity
- On the quadratic spans of DeBruijn sequences
- On the linear complexity of nonlinearly filtered pn-sequences
- Results on the Nonlinear Span of Binary Sequences
- On the Quadratic Span of Binary Sequences
- Constructing Periodic Binary Sequences With Maximum Nonlinear Span
- On the Nonlinear Complexity and Lempel–Ziv Complexity of Finite Length Sequences
- On the linear complexity of Hall's sextic residue sequences
- Investigations on Periodic Sequences With Maximum Nonlinear Complexity
- Construction of Sequences With High Nonlinear Complexity From Function Fields
- On the Linear Complexity of Binary Sequences of Period $4N$ With Optimal Autocorrelation Value/Magnitude
- Progress in Cryptology - INDOCRYPT 2003
This page was built for publication: Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)
