The search functionality is under construction.
The search functionality is under construction.

Linear Complexity of Kronecker Sequences

Kari H. A. KARKKAINEN

  • Full Text Views

    0

  • Cite this

Summary :

Based on the use of Berlekamp-Massey algorithm, six conjectures for the linear complexity (LC) of some Kronecker sequences of two and three component codes are given. Components were chosen from the families of Gold, Kasami, Barker, Golay complementary and M-sequences. Typically, the LC value is a large part of the code length. The LC value of the outermost code influences mostly on the LC value.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.5 pp.1348-1351
Publication Date
2001/05/01
Publicized
Online ISSN
DOI
Type of Manuscript
LETTER
Category
Spread Spectrum Technologies and Applications

Authors

Keyword