On Shift Bound for Cyclic Codes by DFT with Unknown Elements

摘要：

The shift bound is a good lower bound of the minimum distance for cyclic codes, Reed-Muller codes and geometric Goppa codes. In this paper we consider cyclic codes defined by defining sequence and new simple derivation using the discrete Fourier transform with unknown elements and the Blahut theorem is shown. Moreover two examples of binary cyclic codes are given.

关键词： Blahut theorem lower bound discrete Fourier transform cyclic code minimum distance

作者: Junru ZHENG Takayasu KAIDA

作者单位: Department of Information Science, Faculty of Engineering, Kyushu Kyoritsu University Department of Information and Computer Sciences,School of Humanity-Oriented Science and Engineering,

会议类型: 国际会议

会议名称: 第三届信号设计及其在通信中的应用国际会议(Proceedings of 2007 International Workshop on Signal Design and Its Applications in Communications IWSDA07)

会议地点: 成都

会议语种:英文

页码: 114-117

在线出版日期: 2007-09-23（万方平台首次上网日期，不代表论文的发表时间）