Covering codes with improved density |
| |
| Authors: | Krivelevich M. Sudakov B. Vu V.H. |
| |
| Affiliation: | Dept. of Math., Tel-Aviv Univ., Israel; |
| |
| Abstract: | We prove a general recursive inequality concerning /spl mu//sup */(R), the asymptotic (least) density of the best binary covering codes of radius R. In particular, this inequality implies that /spl mu//sup */(R)/spl les/e/spl middot/(RlogR+logR+loglogR+2), which significantly improves the best known density 2/sup R/R/sup R/(R+1)/R!. Our inequality also holds for covering codes over arbitrary alphabets. |
| |
| Keywords: | |
|
|
