By Topic

Two recursive algorithms for computing the weight distribution of certain irreducible 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
$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)
Moisio, M.J. ; Dept. of Math. & Stat., Vaasa Univ., Finland ; Väänänen, K.O.

Two recursive algorithms for computing the weight distributions of certain binary irreducible cyclic codes of length n in the so-called index 2 case are presented. The running times of these algorithms are smaller than O(log2r) where r=2m and n is a factor of r-1

Published in:

Information Theory, IEEE Transactions on  (Volume:45 ,  Issue: 4 )