Product Perfect Z2Z4-linear codes in Steganography
J. Rifa, L. Ronquillo
TL;DR
This paper introduces new steganographic methods based on generalized product perfect codes and perfect Z2Z4-linear codes, demonstrating their effectiveness in data embedding within steganography.
Contribution
It generalizes product perfect codes and applies this to perfect Z2Z4-linear codes for improved steganographic data embedding.
Findings
Enhanced data embedding performance in steganography.
Comparison shows improved efficiency over existing schemes.
Generalized code constructions offer flexible embedding options.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Advanced Steganography and Watermarking Techniques · graph theory and CDMA systems