DocumentCode
70953
Title
Linear complexity of binary sequences with interleaved structure
Author
Hai Xiong ; Longjiang Qu ; Chao Li ; Shaojing Fu
Author_Institution
Sci. Coll., Nat. Univ. of Defense Technol., Changsha, China
Volume
7
Issue
15
fYear
2013
fDate
Oct. 15 2013
Firstpage
1688
Lastpage
1696
Abstract
In this study, the minimal polynomials and the linear complexity of interleaved binary sequences are investigated. Both the linear complexity and the minimal polynomials of low correlation zone sequences constructed by Zhou et al. are completely determined. Besides, an open problem proposed by Li and Tang is discussed. At last, a sufficient condition and a necessary condition are presented about when the linear complexity of the interleaved sequences constructed by Tang et al. attains the maximum.
Keywords
binary sequences; computational complexity; polynomials; interleaved binary sequences; linear complexity; low correlation zone sequences; minimal polynomials; open problem;
fLanguage
English
Journal_Title
Communications, IET
Publisher
iet
ISSN
1751-8628
Type
jour
DOI
10.1049/iet-com.2012.0649
Filename
6648792
Link To Document