Answers are grounded in this paper and cite their sources.
The weight hierarchy of a [n, k; q] linear code C over Fqis 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.
No takes yet. Share an insight, caveat, or question.
Hu et al. (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: