Wet paper codes and the dual distance in steganography - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Advances in Mathematics of Communications Year : 2011

Wet paper codes and the dual distance in steganography

Carlos Munuera
  • Function : Author
  • PersonId : 898945
Morgan Barbier


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.
Fichier principal
Vignette du fichier
Steganography_and_the_dual_distance.pdf (197.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00584877 , version 1 (11-04-2011)



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



Gmail Facebook X LinkedIn More