Location of Repository

Z2Z4-Additive Perdect Codes in Steganography

By Helena Rifà Pous, Lorena Ronquillo and Josep Rifà Coma

Abstract

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

Topics: Stegranography, data hiding, codes, codis, ocultació d'informació, códigos, ocultación de datos
Publisher: ADVANCES IN MATHEMATICS OF COMMUNICATIONS
Year: 2011
OAI identifier: oai:openaccess.uoc.edu:10609/8863
Journal:

Suggested articles

Preview

Citations

  1. (1999). A characterization of 1-perfect additive codes, doi
  2. (2009). Asymptotically optimal perfect steganographic systems, doi
  3. (2005). Capacity and codes for embedding information in grayscale signals, doi
  4. (2008). Constructing good covering codes for applications in steganography, doi
  5. (2005). Data-hiding codes, doi
  6. (2007). Grid colorings in steganography,
  7. (2001). High capacity despite better steganalysis (F5 - A steganographic algorithm), doi
  8. (2009). Product perfect codes and steganography, doi
  9. (1998). Some notes on steganography, available from http://www.dia.unisa.it/~ads/ corso-security/www/CORSO-0203/steganografia/LINKS%20LOCALI/matrix-encoding.pdf,
  10. (1977). The Theory of Error-Correcting Codes,” doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.