Construction of Independent Set and Its Application for Designed Minimum Distance

スポンサーリンク

概要

• 論文の詳細を見る

• The shift bound is a good lower bound of the minimum distance for cyclic codes, Reed-Muller codes and geometric Goppa codes. It is necessary to construct the maximum value of the independent set. However, its computational complexity is very large. In this paper, we consider cyclic codes defined by their defining set, and a new method to calculate the lower bound of the minimum distance using the discrete Fourier transform (DFT) is shown. The computational complexity of this method is compared with the shift bound's one. Moreover construction of independent set is shown.

著者

• Kaida Takayasu

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

• Zheng Junru

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

• KAIDA Takayasu

  Department of Information and Computer Sciences, Faculty of Humanity-Oriented Science and Engineering, Kinki 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

スポンサーリンク