A lower bound on the weight hierarchies of product codes

被引：14

作者：

Schaathun, HG

Willems, W

机构：

[1] Univ Bergen, Inst Informat, N-5020 Bergen, Norway

[2] Otto Von Guericke Univ, Fak Math, D-39106 Magdeburg, Germany

来源：

DISCRETE APPLIED MATHEMATICS | 2003年 / 128卷 / 01期

关键词：

product code; projective multiset; weight hierarchy; Segre embedding; chain condition;

D O I：

10.1016/S0166-218X(02)00449-3

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The weight of a code is the number of coordinate positions where not all codewords are zero. The rth minimum weight d(r) is the least weight of an r-dimensional subcode. Wei and Yang conjectured a formula for the minimum weights of some product codes, and this conjecture has recently been proved in two different ways. In this self-contained paper, we give a further generalisation, with a new proof which also covers the old results. (C) 2003 Elsevier Science B.V. All rights reserved.

引用

页码：251 / 261

页数：11

共 50 条

[41] Weight hierarchies of linear codes satisfying the almost chain condition
陈文德
TorleivKlφve
[J]. Science China(Information Sciences), 2003, (03) : 175 - 186
[42] ON A CLASS OF WEIGHT HIERARCHIES OF TERNARY LINEAR CODES OF DIMENSION 4
LIU Zihui CHEN Wende(Laboratory of Systems and Control
[J]. Journal of Systems Science & Complexity, 2004, (01) : 86 - 95
[43] Weight hierarchies of linear codes satisfying the almost chain condition
Chen, WD
Klove, T
[J]. ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 233 - 233
[44] The weight distributions of some product codes
Andrew, R
[J]. 2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 226 - 226
[45] Lower bound for the number of iterations in semidefinite hierarchies for the cut polytope
Laurent, M
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 2003, 28 (04) : 871 - 883
[46] LOWER BOUNDS FOR CONSTANT WEIGHT CODES
GRAHAM, RL
SLOANE, NJA
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (01) : 37 - 43
[47] On a lower bound on the number of perfect binary codes
Malyugin, SA
[J]. DISCRETE APPLIED MATHEMATICS, 2004, 135 (1-3) : 157 - 160
[48] A lower bound for the number of transitive perfect codes
Potapov V.N.
[J]. Journal of Applied and Industrial Mathematics, 2007, 1 (3) : 373 - 379
[49] AN IMPROVEMENT OF THE GILBERT BOUND FOR CONSTANT WEIGHT CODES
ERICSON, T
ZINOVIEV, VA
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (05) : 721 - 723
[50] An upper bound for binary constant weight codes
Fu, FW
Shen, SY
[J]. JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 2001, 94 (02) : 197 - 203

← 1 2 3 4 5 →