Trace Representation of Binary Generalized Cyclotomic Sequences with Length p^m

スポンサーリンク

概要

• 論文の詳細を見る

• Some new generalized cyclotomic sequences defined by C. Ding and T. Helleseth are proven to exhibit a number of good randomness properties. In this paper, we determine the defining pairs of these sequences of length pm (p prime, m å 2) with order two, then from which we obtain their trace representation. Thus their linear complexity can be derived using Keys method.

• （社）電子情報通信学会の論文
• 2011-02-01

著者

• Du Xiaoni

  College Of Mathematics And Information Science Northwest Normal University

• Chen Zhixiong

  Key Lab Of Applied Mathematics Putian University

• Du Xiaoni

  College Of Mathematics And Information Science Northwest Normal Univ.

• Du Xiaoni

  College Of Mathematic And Information Science Northwest Normal University

関連論文

• Trace Representation of a New Class of Sextic Residue Sequences of Period p≡3 (mod 8)
• On the Linear Complexity of Some Ternary Sequences with Ideal Autocorrelation
• A Construction of Binary Cyclotomic Sequences Using Extension Fields
• Trace Representation of Binary Generalized Cyclotomic Sequences with Length p^m
• On the Randomness of Generalized Cyclotomic Sequences of Order Two and Length pq(Information Security)
• Linear Complexity of Quaternary Sequences Generated Using Generalized Cyclotomic Classes Modulo 2p
• Construction of d-Form Sequences with Ideal Autocorrelation
• Binary Threshold Sequences Derived from Carmichael Quotients with Even Numbers Modulus

スポンサーリンク