By Topic

Weight enumerators of more irreducible cyclic binary 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
$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

1 Author(s)

The weight enumerators of all nondegenerate irreducible cyclic binary (n, k) codes have been computed for which k>27 and N=(2k-1)/n<500. The methods used are those developed by McEliece and further expanded by Ward and Segar (1986), using algebraic number theory and Stickelberger's theorem

Published in:

Information Theory, IEEE Transactions on  (Volume:39 ,  Issue: 5 )