The Linear Complexity of Some Binary Sequences With Three-Level Autocorrelation

DOI10.1109/TIT.2010.2050831MaRDI QIDQ5281361zbMATH OpenOpenAlexFDO

Authors Qi Wang

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.2050831

Mathematics Subject Classification ID

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

Recommendations

• The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation
• Several classes of binary sequences with three-level autocorrelation
• The linear complexity of a class of binary sequences with optimal autocorrelation
• The Linear Complexity of Binary Sequences With Optimal Autocorrelation
• New families of binary sequences with optimal three-level autocorrelation
• The study of methods for constructing binary sequence pairs with three-level autocorrelation
• On the computation of the non-periodic autocorrelation function of two ternary sequences and its related complexity analysis
• Linear complexity profile of binary sequences with small correlation measure
• scientific article; zbMATH DE number 6262500

Cited in

(3)

• The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
• Some cyclic codes with prime length from cyclotomy of order 4
• Linear complexity and 2-adic complexity of new cyclotomic binary sequences of order four with low autocorrelation

This page was built for publication: The Linear Complexity of Some Binary Sequences With Three-Level Autocorrelation

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