On Linear Complexity and Schaub Bound for Cyclic Codes by Defining Sequence with Unknown Elements(<Special Section>Sequence Design and its Application in Communications)

スポンサーリンク

概要

• 論文の詳細を見る

• The Schaub bound is one of well-known lower bounds of the minimum distance for given cyclic code C, and defined as the minimum value, which is a lower bound on rank of matrix corresponding a codeword, in defining sequence for all sub-cyclic codes of given code C. In this paper, we will try to show relationships between the Schaub bound, the Roos bound and the shift bound from numerical experiments. In order to reduce computational time for the Schaub bound, we claim one conjecture, from numerical examples in binary and ternary cases with short code length that the Schaub bound can be set the value from only defining sequence of given code C.

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

著者

• Kaida Takayasu

  Kinki Univ. Iizuka‐shi Jpn

• Kaida Takayasu

  Department Of Information And Computer Sciences Faculty Of Humanity-oriented Science And Engineering

• Zheng Junru

  Kyushu Women's Univ. Kitakyushu‐shi Jpn

• Zheng Junru

  Department Of Human Development Faculty Of Human Sciences Kyushu Women's University

関連論文

• A Note on the Shift Bound for Cyclic Codes by the DFT
• Value Distribution of Linear Complexity for p-Ary Periodic Sequences with Period p^n, p a Prime
• Some Properties of the Schaub Bound and Its Improvement for Cyclic Codes
• On Linear Complexity and Schaub Bound for Cyclic Codes by Defining Sequence with Unknown Elements(Sequence Design and its Application in Communications)
• A Note on Decoding Algorithm by Calculation of Schaub Bound for Cyclic Codes
• On Relationship between the Boston Bound and Well-Known Bounds for Cyclic Codes
• An Improvement of the Hartmann-Tzeng Bound for Cyclic Codes and Their Binary and Short Examples
• Construction of Independent Set and Its Application for Designed Minimum Distance
• On Constant-Weight Multi-Valued Sequences from Cyclic Difference Sets

スポンサーリンク