Title of article
Covering codes with improved density
Author/Authors
M.، Krivelevich, نويسنده , , B.، Sudakov, نويسنده , , V.H.، Vu, نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2003
Pages
-1811
From page
1812
To page
0
Abstract
We prove a general recursive inequality concerning (mu)/sup */(R), the asymptotic (least) density of the best binary covering codes of radius R. In particular, this inequality implies that (mu)/sup */(R)
Keywords
Abdominal obesity , Food patterns , waist circumference , Prospective study
Journal title
IEEE Transactions on Information Theory
Serial Year
2003
Journal title
IEEE Transactions on Information Theory
Record number
94986
Link To Document