The linear complexity of some binary sequences with three-level autocorrelation

Authors:
Qi Wang
Affiliations:
Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 11
Cited 0

Finite fields

Finite fields
Difference Sets and Hyperovals

Designs, Codes and Cryptography
Shift Register Sequences

Shift Register Sequences
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar

Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Binary sequences with optimal autocorrelation

Theoretical Computer Science
Q-ary cascaded GMW sequences

IEEE Transactions on Information Theory
Binary pseudorandom sequences of period 2m-1 with ideal autocorrelation generated by the polynomial zd+(z+1)d

IEEE Transactions on Information Theory
Autocorrelation values of generalized cyclotomic sequences of order two

IEEE Transactions on Information Theory
Several classes of binary sequences with three-level autocorrelation

IEEE Transactions on Information Theory
Almost difference sets and their sequences with optimal autocorrelation

IEEE Transactions on Information Theory
New cyclic difference sets with Singer parameters

Finite Fields and Their Applications

Quantified Score

Hi-index	754.84

Visualization

Abstract

Binary sequences with good autocorrelation are needed in many applications. A construction of binary sequences with three-level autocorrelation was recently presented. This construction is generic and powerful in the sense that many classes of binary sequences with three-level autocorrelation could be obtained from any difference set with Singer parameters. The objective of this paper is to determine both the linear complexity and the minimal polynomial of two classes of binary sequences, i.e., the class based on the Singer difference set, and the class based on the GMW difference set.