On the weight hierarchy of codes associated to curves of complete intersection (Q1910738)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the weight hierarchy of codes associated to curves of complete intersection |
scientific article; zbMATH DE number 858626
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the weight hierarchy of codes associated to curves of complete intersection |
scientific article; zbMATH DE number 858626 |
Statements
On the weight hierarchy of codes associated to curves of complete intersection (English)
0 references
24 June 1996
0 references
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.
0 references
generalized Hamming weights
0 references
codes
0 references
curves
0 references
complete intersection
0 references
minimum distances
0 references
