Title of article
Multicovering Bounds from Linear Inequalities (Extended Abstract)
Author/Authors
Klapper، نويسنده , , Andrew، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
10
From page
25
To page
34
Abstract
The multicovering radii of a code are natural generalizations of the covering radius in which the goal is to cover all m-tuples of vectors for some m as cheaply as possible. In this paper we use the method of linear inequalities to obtain new lower bounds on the sizes of codes achieving given multicovering radii. These bounds arise from linear inequalities involving the weight distributions of the code.
Keywords
Covering radius , Error Correcting Codes , the method of linear inequalities , lower bounds , Weight distribution
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2001
Journal title
Electronic Notes in Discrete Mathematics
Record number
1452975
Link To Document