DocumentCode :
1534248
Title :
The Linear Complexity of Some Binary Sequences With Three-Level Autocorrelation
Author :
Wang, Qi
Author_Institution :
Dept. of Comput. Sci. & Eng., Hong Kong Univ. of Sci. & Technol., Kowloon, China
Volume :
56
Issue :
8
fYear :
2010
Firstpage :
4046
Lastpage :
4052
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.
Keywords :
binary sequences; computational complexity; set theory; GMW difference set; Singer difference set; Singer parameter; binary sequence; linear complexity; minimal polynomial; three-level autocorrelation; Autocorrelation; Binary sequences; Bridges; Computer science; Galois fields; Global Positioning System; Multiaccess communication; Polynomials; Spread spectrum communication; Almost difference set; GMW difference set; Singer difference set; autocorrelation; difference set; linear complexity;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2010.2050831
Filename :
5508635
Link To Document :
بازگشت