Covering radius and dual distance |
| |
Authors: | A. Tietäväinen |
| |
Affiliation: | (1) Department of Mathematics, University of Turku, SF-20500 Turku, Finland |
| |
Abstract: | Recently a number of bounds have been obtained for the covering radius of a code with given length and cardinality. In this paper we show that—perhaps surprisingly—the covering radius of a code depends heavily on its dual distance. We consider an arbitrary finite Abelian group alphabet though in the applications the alphabet is very often the field F2. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|