355 research outputs found
Product Perfect Codes and Steganography
A new coding technique to be used in steganography is evaluated. The performance
of this new technique is computed and comparisons with the well-known theoretical
upper bound, Hamming upper bound and basic LSB are established
Improving success probability and embedding efficiency in code based steganography
For stegoschemes arising from error correcting codes, embedding depends on a
decoding map for the corresponding code. As decoding maps are usually not
complete, embedding can fail. We propose a method to ensure or increase the
probability of embedding success for these stegoschemes. This method is based
on puncturing codes. We show how the use of punctured codes may also increase
the embedding efficiency of the obtained stegoschemes
Wet paper codes and the dual distance in steganography
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
Z2Z4-Additive Perdect Codes in Steganography
Steganography is an information hiding application which aims to
hide secret data imperceptibly into a cover object. In this paper, we describe a
novel coding method based on Z2Z4-additive codes in which data is embedded
by distorting each cover symbol by one unit at most (+-1-steganography). This
method is optimal and solves the problem encountered by the most e cient
methods known today, concerning the treatment of boundary values. The
performance of this new technique is compared with that of the mentioned
methods and with the well-known rate-distortion upper bound to conclude that
a higher payload can be obtained for a given distortion by using the proposed
method
- …