Minimizing the embedding impact in steganography
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
Fast communication: Steganography and error-correcting codes
Signal Processing
Asymptotic behavior of the ZZW embedding construction
IEEE Transactions on Information Forensics and Security
Batch steganography and pooled steganalysis
IH'06 Proceedings of the 8th international conference on Information hiding
Constructing good covering codes for applications in steganography
Transactions on data hiding and multimedia security III
IH'05 Proceedings of the 7th international conference on Information Hiding
IEEE Transactions on Signal Processing - Part II
Matrix embedding for large payloads
IEEE Transactions on Information Forensics and Security
Capacity and codes for embedding information in gray-scale signals
IEEE Transactions on Information Theory
Grid Colorings in Steganography
IEEE Transactions on Information Theory
Generalization and analysis of the paper folding method for steganography
IEEE Transactions on Information Forensics and Security
Data embedding in image-media using weight-function on modulo operations
ACM Transactions on Embedded Computing Systems (TECS) - Special issue on embedded systems for interactive multimedia services (ES-IMS)
Interpolation of steganographic schemes
Signal Processing
Hi-index | 0.00 |
We generalize the Zhang, Zhang, and Wang (ZZW) construction to produce larger code families for steganography from existing codes, which can cover the range of relative payloads more densely. We also prove that the expanded code family keeps the similar asymptotic property as the code family produced by the ZZW construction, that is, the codes follow the theoretic upper bound on embedding efficiency as relative payload tends to zero.