Linear Complexity of Binary Golay Complementary Sequences

Kari H. A. KARKKAINEN  Pentti A. LEPPANEN  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E79-A   No.4   pp.609-613
Publication Date: 1996/04/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Spread Spectrum Technologies and Applications
Keyword: 
spread-spectrum technique,  spreading codes,  non-linear sequences,  information security,  linear complexity,  

Full Text: PDF>>
Buy this Article




Summary: 
It is demonstrated with the Berlekamp-Massey shift-register synthesis algorithm that the linear complexity value of binary complementary sequences is at least 3/4 of the sequence length. For some sequence pairs the linear complexity value can be even 0.98 times the sequence length. In the light of these results strongly non-linear complementary sequences are considered suitable for information security applications employing the spread-spectrum (SS) technique.