Channel Coding for Telecommunications
Channel Coding for Telecommunications
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Steganography Preserving Statistical Properties
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Perturbed quantization steganography with wet paper codes
Proceedings of the 2004 workshop on Multimedia and security
Exploiting preserved statistics for steganalysis
IH'04 Proceedings of the 6th international conference on Information Hiding
IH'05 Proceedings of the 7th international conference on Information Hiding
IEEE Transactions on Signal Processing - Part II
On the limits of steganography
IEEE Journal on Selected Areas in Communications
How Reed-Solomon codes can improve steganographic schemes
EURASIP Journal on Information Security - Special issue on secure steganography in multimedia content
Improved embedding based on a set of cover images
Proceedings of the 11th ACM workshop on Multimedia and security
Generalization of the ZZW embedding construction for steganography
IEEE Transactions on Information Forensics and Security
How can reed-Solomon codes improve steganographic schemes?
IH'07 Proceedings of the 9th international conference on Information hiding
Reducing the complexity of syndrome coding for embedding
IH'07 Proceedings of the 9th international conference on Information hiding
Hybrid wet paper coding mechanism for steganography employing n-indicator and fuzzy edge detector
Digital Signal Processing
Near-optimal codes for information embedding in gray-scale signals
IEEE Transactions on Information Theory
Generalization and analysis of the paper folding method for steganography
IEEE Transactions on Information Forensics and Security
A compact covering method to exploit embedding capacity for matrix encoding
Information Sciences: an International Journal
Ensuring message embedding in wet paper steganography
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
An improved matrix encoding scheme for JPEG steganography
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
Distortion function designing for JPEG steganography with uncompressed side-image
Proceedings of the first ACM workshop on Information hiding and multimedia security
New channel selection criterion for spatial domain steganography
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
An attempt to generalize distortion measure for JPEG steganography
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
| Hi-index | 0.06 |
With Matrix Embedding based on Hamming Codes, coding theory has entered the field of steganography. Even though this class of structured codes had been used successfully in practical systems to minimize the number of embedding changes, thus maximizing embedding efficiency, further developments, such as Wet Paper Codes, were based on random codes instead.This paper redraws attention to structured codes, which are built according to deterministic rules. In particular, we study BCH Codes for embedding with syndrome coding, using either a structured matrix Hk x n as in Matrix Embedding, or a generator polynomial g(χ). We propose different approaches for embedding without locked elements, which differ in the tradeoff reached between embedding complexity and efficiency.As some practical systems allow more secure steganography if embedding constraints -- in terms of locked elements -- are respected, we demonstrate how BCH Codes can be employed in a Wet Paper Codes scenario as well. Based on a deduced analogy between code rate and the maximum number of lockable elements, we can find appropriate code parameters for a given fraction of locked elements in the cover, complexity constraints, and desired probability of successful embedding.