Sciweavers

238 search results - page 1 / 48
» Covering Codes for Hats-on-a-line
Sort
View
TDHMS
2008
13 years 4 months ago
Constructing Good Covering Codes for Applications in Steganography
Application of covering codes to data embedding improves embedding efficiency and security of steganographic schemes. In this paper, we describe several familes of covering codes c...
Jürgen Bierbrauer, Jessica J. Fridrich
SIAMDM
2002
84views more  SIAMDM 2002»
13 years 4 months ago
Multicovering Bounds from Relative Covering Radii
The multicovering radii of a code are recently introduced natural generalizations of the covering radius measuring the smallest radius of balls around codewords that cover all m-t...
Iiro S. Honkala, Andrew Klapper
DCC
2002
IEEE
13 years 4 months ago
Bounds on the Covering Radius of Linear Codes
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
Alexei E. Ashikhmin, Alexander Barg
ECCC
2007
96views more  ECCC 2007»
13 years 4 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky