Bounds on the Weight Hierarchies of Extremal Non-chain Codes of Dimension 4 |
| |
| Authors: | Wende Chen Torleiv Kløve |
| |
| Affiliation: | (1) Institute of Systems Science, Academia Sinica and Key State Lab. of Information Security, Graduate School of Academia Sinica, Beijing 100080, China, CN;(2) Department of Informatics, University of Bergen HIB, N-5020 Bergen, Norway, NO |
| |
| Abstract: | The weight hierarchy of a linear n, k; q] code C over GF(q) is the sequence (d
1, d
2, . . . , d
k
) where d
r
is the smallest support of an r-dimensional subcode of C. An n, k; q] code is external non-chain if for any r and s, where 1≦r<s≦k, there are no subspaces D and E, such that D⊂E, dim D=r, dim E=s, w
S
(D)=d
r
, and w
S
(E)=d
s
. Bounds on the weight hierarchies of such codes of dimension 4 are studied.
Received: September 27, 1996 |
| |
| Keywords: | : Weight hierarchy Support Weight q-ary code Chain condition Difference sequence |
| 本文献已被 SpringerLink 等数据库收录！ |
|
