论文部分内容阅读
The weight hierarchy of a [n; kI q] linear code C over Fq is the sequence(d1,… dr,… dk), where dr is the smallest support weight of an r-dimensional subcode of C. In this paper, by using the finite projective geometry method, we research a class of weight hierarchy of linear codes with dimension 5. We first find some new preconditions of this class. Then we divide its weight hierarchies into six subclasses, and research one subclass to determine nearly all the weight hierarchies of this subclass of weight hierarchies of linear codes with dimension 5.
The weight hierarchy of a [n; kI q] linear code C over Fq is the sequence (d1, ... dr, ... dk), where dr is the smallest support weight of an r-dimensional subcode of C. In this paper, by using the finite projective geometry method, we research a class of weight hierarchy of linear codes with dimension 5. We first find some new preconditions of this class. Then we divide its weight hierarchies into six subclasses, and research one subclass to determine nearly all the weight hierarchies of this subclass of weight hierarchies of linear codes with dimension 5.