On the Linear Complexity of Binary Sequences of Period $4N$ With Optimal Autocorrelation Value/Magnitude

DOI10.1109/TIT.2011.2159575zbMath1365.94385OpenAlexW2127498516MaRDI QIDQ5272256

Xiaohu Tang, Nian Li

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2011.2159575

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (12)

2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude ⋮ On finite length nonbinary sequences with large nonlinear complexity over the residue ring \(\mathbb{Z}_m\) ⋮ 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 linear complexity of a class of binary sequences with optimal autocorrelation ⋮ Correlation properties of interleaved Legendre sequences and Ding-Helleseth-Lam sequences ⋮ 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 ⋮ New optimal binary sequences with period \(4p\) via interleaving Ding-Helleseth-Lam sequences ⋮ 2-adic complexity of binary sequences with interleaved structure ⋮ Finite length sequences with large nonlinear complexity ⋮ Binary sequences with period \(N\) and nonlinear complexity \(N - 2\)

This page was built for publication: On the Linear Complexity of Binary Sequences of Period $4N$ With Optimal Autocorrelation Value/Magnitude