The Linear Complexity of Binary Sequences With Optimal Autocorrelation

DOI10.1109/TIT.2010.2079550zbMath1366.94465OpenAlexW2068122009MaRDI QIDQ5281189

Qi Wang, Xiaoni Du

Publication date: 27 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.2010.2079550

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (7)

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 ⋮ The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude ⋮ Some new balanced and almost balanced quaternary sequences with low autocorrelation ⋮ Some cyclic codes with prime length from cyclotomy of order 4 ⋮ Constructions of almost difference sets from finite fields ⋮ 2-adic complexity of binary sequences with interleaved structure

This page was built for publication: The Linear Complexity of Binary Sequences With Optimal Autocorrelation