The Linear Complexity of Binary Sequences With Optimal Autocorrelation

DOI10.1109/TIT.2010.2079550zbMATH Open1366.94465OpenAlexW2068122009MaRDI QIDQ5281189FDOQ5281189

Authors: 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

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

Cited In (12)

• Some new balanced and almost balanced quaternary sequences with low autocorrelation
• 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
• Constructions of almost difference sets from finite fields
• The Most Significant Bit of Maximum-Length Sequences Over<tex>$BBZ_2^l$</tex>: Autocorrelation and Imbalance
• 2-adic complexity of binary sequences with interleaved structure
• Symmetric 4-adic complexity of quaternary sequences with low autocorrelation and period \(p q\)
• The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
• The Linear Complexity of Some Binary Sequences With Three-Level Autocorrelation
• Some cyclic codes with prime length from cyclotomy of order 4
• Binary sequences with optimal autocorrelation
• Minimum linear span approximation of binary sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281189)