The average radius of codes: Survey and new results

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.

[1]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[2]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[3]  Carlos Munuera,et al.  STEGANOGRAPHY FROM A CODING THEORY POINT OF VIEW , 2011 .

[4]  Patrick Solé,et al.  The edge-forwarding index of orbital regular graphs , 1994, Discret. Math..

[5]  Grigory Kabatiansky,et al.  Steganography via covering codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[6]  Jessica J. Fridrich,et al.  Constructing Good Covering Codes for Applications in Steganography , 2008, Trans. Data Hiding Multim. Secur..

[7]  A. Hora,et al.  Distance-Regular Graphs , 2007 .

[8]  Gérard D. Cohen,et al.  Covering Codes , 2005, North-Holland mathematical library.

[9]  Patrick Solé,et al.  Expanding and Forwarding , 1995, Discret. Appl. Math..

[10]  Patrick Solé,et al.  On the dual distance and the gap of a binary code , 1998, Discret. Math..

[11]  Masaaki Harada,et al.  Extremal self-dual codes with the smallest covering radius , 2000, Discret. Math..