Linear Complexity of Binary Whiteman Generalized Cyclotomic Sequences of Order 4

スポンサーリンク

概要

• 論文の詳細を見る

• In this letter we propose a new Whiteman generalized cyclotomic sequence of order 4. Meanwhile, we determine its linear complexity and minimal polynomial. The results show that this sequence possesses both high linear complexity and optimal balance on 1s and 0s, which may be attractive for cryptographic applications.

• The Institute of Electronics, Information and Communication Engineersの論文

著者

• Yan Tongjiang

  College Of Mathematics And Computational Science China University Of Petroleum

• ZHAO Xubo

  State Key Lab. of ISN, Xidian University

• LI Xiaoping

  State Key Laboratory of ISN, Xidian University

• MA Wenping

  State Key Laboratory of ISN, Xidian University

関連論文

• Construction of d-Form Sequences with Ideal Autocorrelation
• Computing the k-Error Linear Complexity of q-Ary Sequences with Period 2pn
• Scalar Linear Solvability of Matroidal Error Correction Network
• The Linear Complexity of a Class of Binary Sequences with Three-Level Autocorrelation
• Linear Complexity of Binary Whiteman Generalized Cyclotomic Sequences of Order 4
• Equivalent Conditions to Determine the GEKs by the LEKs in a Convolutional Network Code over a Cyclic Network
• Computing the k-Error Linear Complexity of q-Ary Sequences with Period 2p^n

スポンサーリンク