On the weight hierarchy of codes associated to curves of complete intersection (Q1910738): Difference between revisions

It was \textit{V. K. Wei} who first introduced the notion of generalized Hamming weights in [IEEE Trans. Inf. Theory IT-37, 1412-1418 (1991; Zbl 0735.94008)]. The weight hierarchy of a linear code is the set of generalized Hamming weights of codes. Here, we consider the generalized Hamming weights of the codes constructed from curves of complete intersection in \textit{L. Z. Tang} [Algebra Colloq. 2, 33-44 (1995; Zbl 0818.94019)]. A general lower bound on their generalized Hamming weights is given, which is similar to the usual lower bound on their minimum distances.