A Lower Bound on the Greedy Weights of Product Codes |
| |
| Authors: | Hans Georg Schaathun |
| |
| Institution: | (1) Institutt for Informatikk, Universitas Bergensis, Høyteknologisenteret, N-5020 Bergen, Norway |
| |
| Abstract: | A greedy 1-subcode is a one-dimensional subcode of minimum (support) weight. A greedy r-subcode is an r-dimensional subcode with minimum support weight under the constraint that it contain a greedy (r - 1)-subcode. The r-th greedy weight e
r is the support weight of a greedy r-subcode. The greedy weights are related to the weight hierarchy. We use recent results on the weight hierarchy of product codes to develop a lower bound on the greedy weights of product codes. |
| |
| Keywords: | product code projective multiset weight hierarchy Segre embedding greedy weights |
| 本文献已被 SpringerLink 等数据库收录！ |
