
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

The Linear Complexity of a Class of Binary Sequences with ThreeLevel Autocorrelation
Yuhua SUN Tongjiang YAN Hui LI
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E96A
No.7
pp.15861592 Publication Date: 2013/07/01
Online ISSN: 17451337
DOI: 10.1587/transfun.E96.A.1586
Print ISSN: 09168508 Type of Manuscript: PAPER Category: Cryptography and Information Security Keyword: binary sequence, autocorrelation, linear complexity,
Full Text: PDF>>
Summary:
Binary sequences with good autocorrelation and large linear complexity have found many applications in communication systems. A construction of almost difference sets was given by Cai and Ding in 2009. Many classes of binary sequences with threelevel autocorrelation could be obtained by this construction and the linear complexity of two classes of binary sequences from the construction have been determined by Wang in 2010. Inspired by the analysis of Wang, we deternime the linear complexity and the minimal polynomials of another class of binary sequences, i.e., the class based on the WG difference set, from the construction by Cai and Ding. Furthermore, a generalized version of the construction by Cai and Ding is also presented.

