The average radius of codes: Survey and new results
Gérard Cohen, Carlos Munuera, Patrick Solé · 2011
The average radius of a block code is a parameter that occurs naturally in quantization and steganography. We give asymptotic upper and lower bounds on this parameter. In particular we show that for almost all long codes the normalized average radius equals the normalized covering radius. We survey some special graph-theoretic lower bounds.