TY - JOUR
T1 - Z2Z4-additive perfect codes in steganography
AU - Rifà-Pous, Helena
AU - Rifà, Josep
AU - Ronquillo, Lorena
PY - 2011/8/1
Y1 - 2011/8/1
N2 - 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 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. © 2011 AIMS-SDU.
AB - 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 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. © 2011 AIMS-SDU.
KW - Steganography
KW - Z Z -additive perfect codes 2 4
U2 - 10.3934/amc.2011.5.425
DO - 10.3934/amc.2011.5.425
M3 - Article
SN - 1930-5346
VL - 5
SP - 425
EP - 433
JO - Advances in Mathematics of Communications
JF - Advances in Mathematics of Communications
ER -