Product Perfect Z2Z4-linear codes in Steganography
Information Theory
2010-03-26 v1 math.IT
Abstract
Product perfect codes have been proven to enhance the performance of the F5 steganographic method, whereas perfect Z2Z4-linear codes have been recently introduced as an efficient way to embed data, conforming to the +/-1-steganography. In this paper, we present two steganographic methods. On the one hand, a generalization of product perfect codes is made. On the other hand, this generalization is applied to perfect Z2Z4-linear codes. Finally, the performance of the proposed methods is evaluated and compared with those of the aforementioned schemes.
Cite
@article{arxiv.1003.4852,
title = {Product Perfect Z2Z4-linear codes in Steganography},
author = {J. Rifa and L. Ronquillo},
journal= {arXiv preprint arXiv:1003.4852},
year = {2010}
}
Comments
6 pages, 2 figures, submitted to the 2010 International Symposium on Information Theory and Its Applications (ISITA2010)