Linear Complexity of Kronecker Sequences

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 一般社団法人電子情報通信学会の論文
• 2001-05-01

著者

• Karkkainen Kari

  Faculty Of Technology Department Of Electrical Engineering Telecommunication Laboratory

関連論文

• Linear Complexity of Kronecker Sequences

スポンサーリンク