Improved lower bounds for multicovering codes

Authors
Klapper, A
Citation
A. Klapper, Improved lower bounds for multicovering codes, IEEE INFO T, 45(7), 1999, pp. 2532-2534
Citations number
6
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE TRANSACTIONS ON INFORMATION THEORY
ISSN journal
00189448 → ACNP
Volume
45
Issue
7
Year of publication
1999
Pages
2532 - 2534
Database
ISI
SICI code
0018-9448(199911)45:7<2532:ILBFMC>2.0.ZU;2-R
Abstract
The m-covering radius of a code is a recent generalization of the covering radius of a code. It is the smallest t such that every m-tuple of vectors i s contained in a ball of Hamming radius t centered at some codeword. We der ive new lower bounds for the size of the smallest code that has a given len gth and m-covering radius.