Linear Complexity of Binary Golay Complementary Sequences
スポンサーリンク
概要
- 論文の詳細を見る
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 considred suitable for information security applications employing the spread-spectrum (SS) technique.
- 一般社団法人電子情報通信学会の論文
- 1996-04-25
著者
-
Leppaenen P
Univ. Oulu Oulu Fin
-
KARKKAINEN Kari
Telecommunication Laboratory, Department of Electrical Engineering, University of Oulu
-
LEPPANEN Pentti
Telecommunication Laboratory, Department of Electrical Engineering, University of Oulu
-
Karkkainen Kari
Telecommunication Laboratory Department Of Electrical Engineering University Of Oulu
関連論文
- Linear Complexity of Binary Golay Complementary Sequences
- Comparison of Performance between AND and Majority Logic Type Nonlinear Feedforward Logic Pseudonoise Sequence Generators
- Meaning of Maximum and Mean-Square Cross-Correlation as a Performance Measure for CDMA Code Families and Their Influence on System Capacity (Special Issue on Spread Spectrum Techniques and Applications)