Two recursive algorithms for computing the weight distribution of certain irreducible cyclic codes
Marko J. Moisio, Keijo Väänänen · IEEE Transactions on Information Theory · 1999
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(log/sup 2/r) where r=2/sup m/ and n is a factor of r-1.