On the Linear Complexity of Generalized Cyclotomic Sequences of Order Four Over Z_<pq>(Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• In this letter we first introduce a new generalized cyclotomic sequence of order four with respect to pq, then we calculate the linear complexity and minimal polynomial of this sequence. Our results show that the new binary sequence is quite good from the linear complexity viewpoint.

• 社団法人電子情報通信学会の論文
• 2005-01-01

著者

• Bai Enjian

  The Isn National Key Laboratories Xidian University

• Xiao Guozhen

  The Isn National Key Laboratories Xidian University

• FU Xiaotong

  the ISN National Key Laboratories, Xidian University

• Fu Xiaotong

  The Isn National Key Laboratories Xidian University

関連論文

• On the Linear Complexity of Generalized Cyclotomic Sequences of Order Four Over Z_(Information Security)

スポンサーリンク