IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Perturbed quantization steganography with wet paper codes
Proceedings of the 2004 workshop on Multimedia and security
A general framework for structural steganalysis of LSB replacement
IH'05 Proceedings of the 7th international conference on Information Hiding
Wet paper codes with improved embedding efficiency
IEEE Transactions on Information Forensics and Security
Statistically undetectable jpeg steganography: dead ends challenges, and opportunities
Proceedings of the 9th workshop on Multimedia & security
A New Approach for Reducing Embedding Noise in Multiple Bit Plane Steganography
ICISP '08 Proceedings of the 3rd international conference on Image and Signal Processing
Benchmarking for Steganography
Information Hiding
Linear codes for high payload steganography
Discrete Applied Mathematics
Product perfect codes and steganography
Digital Signal Processing
Asymptotic behavior of the ZZW embedding construction
IEEE Transactions on Information Forensics and Security
Constructing specific matrix for efficient matrix embedding
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Improving embedding efficiency by incorporating SDCS and WPC
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Improving embedding efficiency via matrix embedding: a case study
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
The square root law does not require a linear key
Proceedings of the 12th ACM workshop on Multimedia and security
The square root law in stegosystems with imperfect information
IH'10 Proceedings of the 12th international conference on Information hiding
A steganographic scheme by fully exploiting modification directions
Expert Systems with Applications: An International Journal
An efficient high payload ±1 data embedding scheme
Multimedia Tools and Applications
A compact covering method to exploit embedding capacity for matrix encoding
Information Sciences: an International Journal
A steganalysis by adjacency pixel bits structure
Computers and Electrical Engineering
Distortion function designing for JPEG steganography with uncompressed side-image
Proceedings of the first ACM workshop on Information hiding and multimedia security
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.00 |
In this paper, we study embedding efficiency, which is an important attribute of steganographic schemes directly influencing their security. It is defined as the expected number of embedded random message bits per one embedding change. Constraining ourselves to embedding realized using linear covering codes (so called matrix embedding), we show that the quantity that determines embedding efficiency is not the covering radius but the average distance to code. We demonstrate that for linear codes of fixed block length and dimension, the highest embedding efficiency (the smallest average distance to code) is not necessarily achieved using codes with the smallest covering radius. Nevertheless, we prove that with increasing code length and fixed rate (i.e., fixed relative message length), the relative average distance to code and the relative covering radius coincide. Finally, we describe several specific examples of q-ary linear codes with q matched to the embedding operation and experimentally demonstrate the improvement in steganographic security when incorporating the coding methods to digital image steganography.