By Topic

Some results on the weight structure of cyclic codes of composite length

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
$31 $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)

In this paper we investigate the weight structure of cyclic codes of composite length n = n_{1} n_{2} . The actual minimum distances of some classes of binary cyclic codes of composite length are derived. For other classes, new lower bounds on the minimum distance are obtained. These new lower bounds improve on the BCH bound for a considerable number of binary cyclic codes.

Published in:

Information Theory, IEEE Transactions on  (Volume:22 ,  Issue: 3 )