Alternative Syndrome-Trellis Codes With Reduced Trellis Complexity

As the state-of-the-art matrix embedding scheme, syndrome-trellis codes (STCs) have been widely used in the field of data hiding. In this paper, for conditions that the cover length is not integral multiple of message length, we give an alternative form of STCs based on quasi convolutional codes, the parity-check matrix of which only consists of single submatrix while that of STCs contains two ones. Experimental results show that the proposed scheme can realize less trellis complexity while achieving similar performance with STCs for these conditions.

[1]  Tomás Pevný,et al.  Using High-Dimensional Image Models to Perform Highly Undetectable Steganography , 2010, Information Hiding.

[2]  Marten van Dijk,et al.  Embedding Information in Grayscale Images , 2001 .

[3]  R. Crandall,et al.  Some Notes on Steganography , 1999 .

[4]  M. B. Ould MEDENI,et al.  A Novel Steganographic Protocol from Error-correcting Codes , 2010, J. Inf. Hiding Multim. Signal Process..

[5]  Anindya Sarkar,et al.  Matrix Embedding With Pseudorandom Coefficient Selection and Error Correction for Robust and Secure Steganography , 2010, IEEE Transactions on Information Forensics and Security.

[6]  Jessica J. Fridrich,et al.  Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes , 2011, IEEE Transactions on Information Forensics and Security.

[7]  Weiming Zhang,et al.  Fast Matrix Embedding by Matrix Extending , 2012, IEEE Transactions on Information Forensics and Security.

[8]  Hyoung-Joong Kim,et al.  Fast BCH Syndrome Coding for Steganography , 2009, Information Hiding.

[9]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[10]  Antje Winkler,et al.  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 , 2006, MM&Sec '06.

[11]  Kjell Jørgen Hole.  A comparison of trellis modules for binary convolutional codes , 1998, IEEE Trans. Commun..

[12]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[13]  Jessica J. Fridrich,et al.  Minimizing embedding impact in steganography using trellis-coded quantization , 2010, Electronic Imaging.

[14]  Hsiang-Cheh Huang,et al.  Copyright Protection with EXIF Metadata and Error Control Codes , 2008, 2008 International Conference on Security Technology.