DocumentCode
3505099
Title
The average radius of codes: Survey and new results
Author
Cohen, Gérard ; Munuera, Carlos ; Solé, Patrick
Author_Institution
LTCI, Telecom ParisTech, Paris, France
fYear
2011
fDate
July 31 2011-Aug. 5 2011
Firstpage
1792
Lastpage
1795
Abstract
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.
Keywords
block codes; steganography; asymptotic lower bounds; asymptotic upper bounds; average radius; block code; quantization; steganography; survey; Binary codes; Entropy; Error correction codes; Indexes; Linear code; Upper bound; covering radius; probability of error; steganography;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location
St. Petersburg
ISSN
2157-8095
Print_ISBN
978-1-4577-0596-0
Electronic_ISBN
2157-8095
Type
conf
DOI
10.1109/ISIT.2011.6033857
Filename
6033857
Link To Document