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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bierbrauer, J.: Crandall’s problem (unpublished) (1998), http://www.ws.binghamton.edu/fridrich/covcodes.pdf
Bossert, M.: Channel Coding for Telecommunications. Wiley, Chichester (1999)
Crandall, R.: Some Notes on steganography. Posted on Steganography Mailing List (1998), http://os.inf.tu-dresden.de/~westfeld/crandall.pdf
Fridrich, J., Goljan, M., Lisonek, P., Soukal, D.: Writing on Wet Paper. Proc. of IEEE Transcription on Signal Processing 53, 3923–3935 (2005)
Fridrich, J., Goljan, M., Lisonek, P., Soukal, D.: Writing on Wet Paper. Proc. of EI SPIE San Jose 5681, 328–340 (2005)
Fridrich, J., Goljan, M., Soukal, D.: Perturbed Quantization Steganography with Wet Paper Codes. In: Proc. of ACM Multimedia and Security Workshop, Germany, pp. 4–15 (2004)
Fridrich, J., Goljan, M., Soukal, D.: Efficient Wet Paper Codes. In: Barni, M., Herrera-Joancomartí, J., Katzenbeisser, S., Pérez-González, F. (eds.) IH 2005. LNCS, vol. 3727, pp. 204–218. Springer, Heidelberg (2005)
Fridrich, J., Soukal, D.: Matrix Embedding for Large Payloads. Proc. of EI SPIE San Jose 6072, 727–738 (2006)
Galand, F., Kabatiansky, G.: Information hiding by coverings. In: Proc. of IEEE Information Theory Workshop, pp. 151–154 (2004)
Klimant, H., Piotraschke, R., Schönfeld, D.: Informations- und Kodierungstheorie. Teubner Verlag Wiesbaden (2006)
Schönfeld, D.: Einbetten mit minimaler Werkänderung (Embedding with minimal cover changes). Datenschutz und Datensicherheit DuD, Vieweg Verlag 25(11), 666–671 (2001)
Schönfeld, D., Winkler, A.: Embedding with Syndrome Coding Based on BCH Codes. In: Proc. of ACM Multimedia and Security Workshop, Switzerland, pp. 214–223 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schönfeld, D., Winkler, A. (2007). Reducing the Complexity of Syndrome Coding for Embedding. In: Furon, T., Cayre, F., Doërr, G., Bas, P. (eds) Information Hiding. IH 2007. Lecture Notes in Computer Science, vol 4567. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77370-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-77370-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77369-6
Online ISBN: 978-3-540-77370-2
eBook Packages: Computer ScienceComputer Science (R0)