By Topic

An algorithm for new lower bound of minimum distance by DFT for cyclic codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Junru Zheng ; Fac. of Humanities, Kyushu Women''s Univ., Fukuoka, Japan ; Kaida, T.

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 large. 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.

Published in:

Information Theory and its Applications (ISITA), 2010 International Symposium on

Date of Conference:

17-20 Oct. 2010