Skip to Main content Skip to Navigation
Journal articles

Wet paper codes and the dual distance in steganography

Carlos Munuera 1 Morgan Barbier 2 
2 TANC - Algorithmic number theory for cryptology
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : In 1998 Crandall introduced a method based on coding theory to secretly embed a message in a digital support such as an image. Later Fridrich et al. improved this method to minimize the distortion introduced by the embedding; a process called wet paper. However, as previously emphasized in the literature, this method can fail during the embedding step. Here we find sufficient and necessary conditions to guarantee a successful embedding by studying the dual distance of a linear code. Since these results are essentially of combinatorial nature, they can be generalized to systematic codes, a large family containing all linear codes. We also compute the exact number of solutions and point out the relationship between wet paper codes and orthogonal arrays.
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Morgan Barbier Connect in order to contact the contributor
Submitted on : Monday, April 11, 2011 - 10:46:56 AM
Last modification on : Friday, February 4, 2022 - 3:11:46 AM
Long-term archiving on: : Tuesday, July 12, 2011 - 2:39:45 AM


Files produced by the author(s)




Carlos Munuera, Morgan Barbier. Wet paper codes and the dual distance in steganography. Advances in Mathematics of Communications, AIMS, 2011, Lecture Notes on Computer Sciences, 6 (3), pp.273-285. ⟨10.3934/amc.2012.6.273⟩. ⟨inria-00584877⟩



Record views


Files downloads