Skip to main content
Top
Published in: Annals of Telecommunications 7-8/2014

01-08-2014

Syndrome trellis codes based on minimal span generator matrix

Authors: Weiwei Liu, Guangjie Liu, Yuewei Dai

Published in: Annals of Telecommunications | Issue 7-8/2014

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

To improve the embedding efficiency of steganography, syndrome coding based on the coding theory has attracted many researchers’ attentions. In this paper, we make use of the relationship between syndrome coding for minimizing additive distortion and maximum likelihood decoding for linear codes to analyze the main parameters of convolutional codes which influence the embedding efficiency. And, the new syndrome trellis codes based on minimal span generator matrix is proposed. It can be considered an alternative construction of the state-of-the-art syndrome trellis codes (STCs) proposed by Filler and Fridrich recently. Experimental results show that the proposed scheme owns the same embedding performance to STCs and achieve the reduced time complexity and storage requirement meanwhile.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Böhme R, Westfeld A (2005) Exploiting preserved statistics for steganalysis[C]//Information Hiding. Springer, Heidelberg, pp 359–379 Böhme R, Westfeld A (2005) Exploiting preserved statistics for steganalysis[C]//Information Hiding. Springer, Heidelberg, pp 359–379
2.
go back to reference Crandall R. Some notes on steganography[J]. Posted on steganography mailing list, 1998 Crandall R. Some notes on steganography[J]. Posted on steganography mailing list, 1998
3.
go back to reference Westfeld A, Pfitzmann A. High capacity despite better steganalysis (F5—a steganographic algorithm)[C]//Information Hiding, 4th International Workshop. Pittsburgh, PA, 2001, 2137: 289–302 Westfeld A, Pfitzmann A. High capacity despite better steganalysis (F5—a steganographic algorithm)[C]//Information Hiding, 4th International Workshop. Pittsburgh, PA, 2001, 2137: 289–302
4.
go back to reference van Dijk M, Willems F. (2001) Embedding information in grayscale images[C]//Proceedings of the 22nd Symposium on Information and Communication Theory in the Benelux, Enschede, The Netherlands. 147–154 van Dijk M, Willems F. (2001) Embedding information in grayscale images[C]//Proceedings of the 22nd Symposium on Information and Communication Theory in the Benelux, Enschede, The Netherlands. 147–154
5.
go back to reference Zhang W, Wang S, Zhang X (2007) Improving embedding efficiency of covering codes for applications in steganography[J]. Communications Letters, IEEE 11(8):680–682CrossRef Zhang W, Wang S, Zhang X (2007) Improving embedding efficiency of covering codes for applications in steganography[J]. Communications Letters, IEEE 11(8):680–682CrossRef
6.
go back to reference Fridrich J, Soukal D (2006) Matrix embedding for large payloads[J]. Information Forensics and Security, IEEE Transactions on 1(3):390–395CrossRef Fridrich J, Soukal D (2006) Matrix embedding for large payloads[J]. Information Forensics and Security, IEEE Transactions on 1(3):390–395CrossRef
7.
go back to reference Schönfeld D, Winkler A (2006) Embedding with syndrome coding based on BCH codes[C]//Proceedings of the 8th workshop on Multimedia and security. ACM, 214–223 Schönfeld D, Winkler A (2006) Embedding with syndrome coding based on BCH codes[C]//Proceedings of the 8th workshop on Multimedia and security. ACM, 214–223
8.
go back to reference Zhang R, Sachnev V, Kim H (2009) Fast BCH syndrome coding for steganography[C]//Information Hiding. Springer, Heidelberg, pp 48–58 Zhang R, Sachnev V, Kim H (2009) Fast BCH syndrome coding for steganography[C]//Information Hiding. Springer, Heidelberg, pp 48–58
9.
go back to reference Fontaine C, Galand F (2009) How Reed-Solomon codes can improve steganographic schemes[J]. EURASIP J Inf Secur 2009:1CrossRef Fontaine C, Galand F (2009) How Reed-Solomon codes can improve steganographic schemes[J]. EURASIP J Inf Secur 2009:1CrossRef
10.
11.
go back to reference Fridrich J, Goljan M, Soukal D (2004) Perturbed quantization steganography with wet paper codes[C]//International Multimedia Conference: Proceedings of the 2004 workshop on Multimedia and security. 20(21): 4–15. Fridrich J, Goljan M, Soukal D (2004) Perturbed quantization steganography with wet paper codes[C]//International Multimedia Conference: Proceedings of the 2004 workshop on Multimedia and security. 20(21): 4–15.
12.
go back to reference Fridrich J, Goljan M, Lisonek P et al (2005) Writing on wet paper[J]. Signal Processing, IEEE Transactions on 53(10):3923–3935CrossRefMathSciNet Fridrich J, Goljan M, Lisonek P et al (2005) Writing on wet paper[J]. Signal Processing, IEEE Transactions on 53(10):3923–3935CrossRefMathSciNet
13.
go back to reference Fridrich J, Filler T (2007) Practical methods for minimizing embedding impact in steganography[C]. Proceedings SPIE Electronic Imaging, Security, Steganography, and Watermarking of Multimedia Contents IX, San Jose, CA 6505:02–03 Fridrich J, Filler T (2007) Practical methods for minimizing embedding impact in steganography[C]. Proceedings SPIE Electronic Imaging, Security, Steganography, and Watermarking of Multimedia Contents IX, San Jose, CA 6505:02–03
14.
go back to reference Filler T, Fridrich J (2007) Binary quantization using belief propagation with decimation over factor graphs of LDGM codes[J]. arXiv preprint arXiv:0710.0192 Filler T, Fridrich J (2007) Binary quantization using belief propagation with decimation over factor graphs of LDGM codes[J]. arXiv preprint arXiv:0710.0192
15.
go back to reference Filler T, Judas J, Fridrich J (2010) Minimizing embedding impact in steganography using trellis-coded quantization[J]. Proceedings of Media Forensics and Security III, SPIE 7451:715405–1 Filler T, Judas J, Fridrich J (2010) Minimizing embedding impact in steganography using trellis-coded quantization[J]. Proceedings of Media Forensics and Security III, SPIE 7451:715405–1
16.
go back to reference Filler T, Judas J, Fridrich J (2011) Minimizing additive distortion in steganography using syndrome-trellis codes[J]. Information Forensics and Security, IEEE Transactions on 6(3):920–935CrossRef Filler T, Judas J, Fridrich J (2011) Minimizing additive distortion in steganography using syndrome-trellis codes[J]. Information Forensics and Security, IEEE Transactions on 6(3):920–935CrossRef
17.
go back to reference Pevný T, Filler T, Bas P (2010) Using high-dimensional image models to perform highly undetectable steganography[C]//Information Hiding. Springer, Heidelberg, pp 161–177 Pevný T, Filler T, Bas P (2010) Using high-dimensional image models to perform highly undetectable steganography[C]//Information Hiding. Springer, Heidelberg, pp 161–177
18.
go back to reference Sidorenko V, Zyablov V (1994) Decoding of convolutional codes using a syndrome trellis[J]. Information Theory, IEEE Transactions on 40(5):1663–1666CrossRefMATHMathSciNet Sidorenko V, Zyablov V (1994) Decoding of convolutional codes using a syndrome trellis[J]. Information Theory, IEEE Transactions on 40(5):1663–1666CrossRefMATHMathSciNet
19.
go back to reference Viterbi A (1967) Error bounds for convolutional codes and an asymptotically optimum decoding algorithm[J]. Information Theory, IEEE Transactions on 13(2):260–269CrossRefMATH Viterbi A (1967) Error bounds for convolutional codes and an asymptotically optimum decoding algorithm[J]. Information Theory, IEEE Transactions on 13(2):260–269CrossRefMATH
20.
go back to reference Hole KJ (1998) A comparison of trellis modules for binary convolutional codes[J]. Communications, IEEE Transactions on 46(10):1245–1249CrossRefMATH Hole KJ (1998) A comparison of trellis modules for binary convolutional codes[J]. Communications, IEEE Transactions on 46(10):1245–1249CrossRefMATH
21.
go back to reference McEliece RJ, Lin W (1996) The trellis complexity of convolutional codes[J]. Information Theory, IEEE Transactions on 42(6):1855–1864CrossRefMATHMathSciNet McEliece RJ, Lin W (1996) The trellis complexity of convolutional codes[J]. Information Theory, IEEE Transactions on 42(6):1855–1864CrossRefMATHMathSciNet
22.
23.
go back to reference Barron RJ, Chen B, Wornell GW (2003) The duality between information embedding and source coding with side information and some applications[J]. Information Theory, IEEE Transactions on 49(5):1159–1180CrossRefMATHMathSciNet Barron RJ, Chen B, Wornell GW (2003) The duality between information embedding and source coding with side information and some applications[J]. Information Theory, IEEE Transactions on 49(5):1159–1180CrossRefMATHMathSciNet
24.
go back to reference Viterbi A, Omura J (1974) Trellis encoding of memoryless discrete-time sources with a fidelity criterion[J]. Information Theory, IEEE Transactions on 20(3):325–332CrossRefMATHMathSciNet Viterbi A, Omura J (1974) Trellis encoding of memoryless discrete-time sources with a fidelity criterion[J]. Information Theory, IEEE Transactions on 20(3):325–332CrossRefMATHMathSciNet
25.
go back to reference Lin S, Costello DJ (2004) Error control coding[M]. Englewood Cliffs, Prentice-Hall Lin S, Costello DJ (2004) Error control coding[M]. Englewood Cliffs, Prentice-Hall
26.
go back to reference Tang HH, Lin MC (2002) On (n, n-1) convolutional codes with low trellis complexity[J]. Communications, IEEE Transactions on 50(1):37–47CrossRef Tang HH, Lin MC (2002) On (n, n-1) convolutional codes with low trellis complexity[J]. Communications, IEEE Transactions on 50(1):37–47CrossRef
Metadata
Title
Syndrome trellis codes based on minimal span generator matrix
Authors
Weiwei Liu
Guangjie Liu
Yuewei Dai
Publication date
01-08-2014
Publisher
Springer Paris
Published in
Annals of Telecommunications / Issue 7-8/2014
Print ISSN: 0003-4347
Electronic ISSN: 1958-9395
DOI
https://doi.org/10.1007/s12243-013-0386-3

Other articles of this Issue 7-8/2014

Annals of Telecommunications 7-8/2014 Go to the issue