IHW '01 Proceedings of the 4th International Workshop on Information Hiding
On steganographic embedding efficiency
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
IEEE Transactions on Signal Processing - Part II
Improving embedding efficiency via matrix embedding: a case study
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Generalization and analysis of the paper folding method for steganography
IEEE Transactions on Information Forensics and Security
An efficient high payload ±1 data embedding scheme
Multimedia Tools and Applications
A study of optimal matrix for efficient matrix embedding in F3
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
Hi-index | 0.05 |
Steganography is concerned with communicating hidden messages in such a way that no one apart from the sender and the intended recipient can detect the very existence of the message. We study the syndrome coding method (sometimes also called the ''matrix embedding method''), which uses a linear code as an ingredient. Among all codes of a fixed block length and fixed dimension (and thus of a fixed information rate), an optimal code is one that makes it most difficult for an eavesdropper to detect the presence of the hidden message. We show that the average distance to code is the appropriate concept that replaces the covering radius for this particular application. We completely classify the optimal codes in the cases when the linear code used in the syndrome coding method is a one- or two-dimensional code over GF(2). In the steganography application this translates to cases when the code carries a high payload (has a high information rate).