Reducing the complexity of syndrome coding for embedding

Authors:
Dagmar Schönfeld;Antje Winkler
Affiliations:
Technische Universität Dresden, Dresden, Germany;Technische Universität Dresden, Dresden, Germany
Venue:
IH'07 Proceedings of the 9th international conference on Information hiding
Year:
2007

Citing 5
Cited 7

Channel Coding for Telecommunications

Channel Coding for Telecommunications
Perturbed quantization steganography with wet paper codes

Proceedings of the 2004 workshop on Multimedia and security
Embedding with syndrome coding based on BCH codes: The corrected version of this paper is now available as full text. To view the original document as presented in the printed proceedings (with its errors), download the supplemental file

MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
Efficient wet paper codes

IH'05 Proceedings of the 7th international conference on Information Hiding
Writing on wet paper

IEEE Transactions on Signal Processing - Part II

How Reed-Solomon codes can improve steganographic schemes

EURASIP Journal on Information Security - Special issue on secure steganography in multimedia content
Less detectable JPEG steganography method based on heuristic optimization and BCH syndrome coding

Proceedings of the 11th ACM workshop on Multimedia and security
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
A robust data hiding algorithm for H.264/AVC video streams

Journal of Systems and Software
An attempt to generalize distortion measure for JPEG steganography

IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
Self-synchronising image steganography algorithms based on error-correcting codes

International Journal of Electronic Security and Digital Forensics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with strategies to dramatically reduce the complexity for embedding based on syndrome coding. In contrast to existing approaches, our goal is to keep the embedding efficiency constant, i.e., to embed less complexly without increasing the average number of embedding changes, compared to the classic Matrix Embedding scenario. Generally, our considerations are based on structured codes, especially on BCH Codes. However, they are not limited to this class of codes. We propose different approaches to reduce embedding complexity concentrating on both syndrome coding based on a parity check matrix and syndrome coding based on the generator polynomial.