Weight Hierarchies of Linear Codes Satisfying the ChainCondition
Designs, Codes and Cryptography
A new kind of geometric structures determining the chain good weight hierarchies
Discrete Mathematics
Duality and Greedy Weights of Linear Codes and Projective Multisets
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The relative generalized Hamming weight of linear q-ary codes and their subcodes
Designs, Codes and Cryptography
Designs, Codes and Cryptography
New code equivalence based on relative generalized Hamming weights
Information Sciences: an International Journal
Further results on support weights of certain subcodes
Designs, Codes and Cryptography
On the Relative Generalized Hamming Weights of Linear Codes and their Subcodes
SIAM Journal on Discrete Mathematics
European Journal of Combinatorics
Higher Weights of Anticodes and the Generalized Griesmer Bound
Finite Fields and Their Applications
Further results on the semilinear equivalence of linear codes
Information Sciences: an International Journal
| Hi-index | 0.00 |
The weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d1,d2,...dk) where dτ is the smallest support of an τ-dimensional subcode of C. The possible weight hierarchies of [n,4;q] codes are studied. In particular, the possible weight hierarchies of [n,4;3] codes are determined