Weight hierarchies of extremal non-chain binary codes of dimension 4
Wende Chen, Torleiv Kløve · IEEE Transactions on Information Theory · 1999
The weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d/sub 1/,d/sub 2/,/spl middot//spl middot//spl middot/,d/sub k/) where d/sub r/ is the smallest support of an r-dimensional subcode of C. An [n,k;q] code is extremal nonchain if, for any r and s, where 1/spl les/r