$\mathbb{Z}_2\mathbb{Z}_4$-additive perfect codes in Steganography
Helena Rifà-Pous Josep Rifà Lorena Ronquillo
Advances in Mathematics of Communications 2011, 5(3): 425-433 doi: 10.3934/amc.2011.5.425
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 $\mathbb{Z}_2\mathbb{Z}_4$-additive codes in which data is embedded by distorting each cover symbol by one unit at most ($\pm 1$-steganography). This method is optimal and solves the problem encountered by the most efficient 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.
keywords: $\mathbb{Z}_2\mathbb{Z}_4$-additive perfect codes. Steganography

Year of publication

Related Authors

Related Keywords

[Back to Top]