On the weight hierarchy of the semiprimi
โ
Tor Helleseth; P. Vijay Kumar
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 320 KB
An irreducible cyclic (n, k) code is said to be semiprimitive if n = (2 k -l)/N where N> 2 divides 2 j + 1 for some j ~1. The complete weight hierarchy of the semiprimitive codes is determined when k/2j is odd. In the other cases, when k/2j is even, some partial results on the generalized Hamming we