A New Method for Calculation of Minimum Distance by DFT for Cyclic Codes

カテゴリ: 部門大会

論文No: MC3-5

グループ名: 【C】平成22年電気学会電子・情報・システム部門大会講演論文集

発行日: 2010/09/02

タイトル(英語): A New Method for Calculation of Minimum Distance by DFT for Cyclic Codes

著者名: 鄭 俊如(九州女子大学),戒田高康 (近畿大学)

著者名(英語): Junru Zheng(Kyushu Women's University),Takayasu Kaida(Kinki University)

キーワード: lower bound|discrete Fourier transform(DFT)|minimum distance|cyclic code

要約(日本語): For cyclic codes some well-known lower bounds and some decoding methods up to the half of the bounds are suggested. Particularly, the shift bound is a good lower bound of the minimum distance for cyclic codes, Reed-Muller codes and geometric Goppa codes. However, the computational complexity of the shift bound is very lager. In this paper we consider cyclic codes defined by their defining set, and a new method of the minimum distance using the discrete Fourier transform(DFT) is shown. Moreover some examples of binary cyclic codes are given.

PDFファイルサイズ: 2,108 Kバイト