Weight Hierarchies of Ternary Linear Codes of Dimension 4 Stasfying the Near-Chain Condition
4维3元近链线性码的重量谱

The weight hierarchy of a linear \ code C over GF(q) is the sequence (d\-1,d\-2,s d\-k), where d\-r is the smallest surpport of an r-dimensional subcode of C. In this paper,by using the projective method, we determined all the weight hierarchies of codes satisfying the Near-Chain condition.