Linear complexity of binary sequences with interleaved structure. Issue 15 (1st October 2013)

• Record Type: Journal Article
• Authors: Xiong, Hai; Qu, Longjiang; Li, Chao; Fu, Shaojing
• Is Part Of: IET communications. Volume 7:Issue 15(2013)
• Page Start: 1688
• Page End: 1696
• Publication Date: 2013-10-01
• Subjects: binary sequences -- computational complexity -- polynomials; linear complexity -- interleaved binary sequences -- minimal polynomials -- low correlation zone sequences -- open problem; Telecommunication systems -- Periodicals; Speech processing systems -- Periodicals; 621.38205
• DOI: 10.1049/iet-com.2012.0649
• Languages: English
• ISSNs: 1751-8628

Abstract

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.