By Topic

Weight distributions of some binary primitive 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

1 Author(s)
J. Wolfmann ; G.E.C.T., Toulon Univ., La Garde, France

Let s and k be integers such that s is a divisor of 2k-1. Let g(x) be a divisor of xs-1 over F2 , and let π(x) be a primitive polynomial of degree k over F2. We consider the binary cyclic code C of length N=2k -1 generated by (XN-1)/g(x)π(x). For special cases, we determine the weight distribution of C by using the weights of the cyclic code of length s generated by (xs-1)/g(x)

Published in:

IEEE Transactions on Information Theory  (Volume:40 ,  Issue: 6 )