Title of article
On Weight Hierarchies of Product Codes The Wei-Yang Conjecture and more
Author/Authors
Martيnez-Pérez، نويسنده , , Conchita and Schaathun، نويسنده , , Hans Georg and Willems، نويسنده , , Wolfgang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
7
From page
65
To page
71
Abstract
The weight of a code is the number of coordinate positions where no codeword is zero. The rth minimum weight dr is the least weight of an r-dimensional subcode. Wei and Yang conjectured a formula for the minimum weights of some product codes. The conjecture is proved in two different ways, each with interesting side-results.
Keywords
projective multiset , Segre embedding , Weight hierarchy , chain condition , Product code
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2001
Journal title
Electronic Notes in Discrete Mathematics
Record number
1452982
Link To Document