On the weight hierarchy of codes associated to curves of complete intersection Original Research Article

This paper deals with the weight hierarchy of codes constructed from curves of complete intersection, and provides a lower bound on their generalized Hamming weights similar to the lower bound on their minimum distance.