On joint information embedding and lossy compression

In this paper, the best achievable tradeoffs between Δ, R_e and R_c, that maintain reliable estimation of V is characterized. The attack-free version of the public problem of joint information embedding and entropy coding, where the covertext, the watermark and the stegotext are drawn from finite alphabets. It is possible to attribute a different watermark to each codebook, and thus, the watermark can be correctly retrieved according to the codebook to which the composite sequence belongs. The achievable rate region can also be expressed in terms of the maximum achievable embedding capacity. The watermark by the joint typicality property of the decompressed composite sequence with the source sequence and the watermark are evaluated.