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 条
12345