On Relationship between the Boston Bound and Well-Known Bounds for Cyclic Codes

スポンサーリンク

概要

• 論文の詳細を見る

• For a cyclic code, the BCH Bound and the Hartmann-Tzeng bound are two of well-known lower bounds for its minimum distance. New bounds are proposed by N. Boston in 2001, that depend on defining set of cyclic code. In this paper, we consider the between the Boston bound and these two bounds for non-binary cyclic codes from numerical examples.

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

著者

• Kaida Takayasu

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

• Kaida Takayasu

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

• Zheng Junru

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

• Zheng Junru

  Department Of Humanities Faculty Of Humanities 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

スポンサーリンク