Correspondence between steganographic protocols and error correcting codes
Keywords:
Steganographic protocol, Hamming distance, Linear correcting code, Covering radius, Parity matrix, BCH codeAbstract
In this work we present a correspondence between the steganographic systems and error correcting codes. We propose a new steganographic protocol based on 3-error-correcting primitive BCH codes. We show that this new protocol has much better parameters than protocols which we get from Hamming codes or from the 2-error-correcting primitive BCH codes, for high levels of incorporation.
Downloads
References
E. F. Assmus, Jr. and H. F. Mattson, Jr., Some 3–error–correcting BCH codes have covering radius 5, IEEE Trans. Inform. Theory 22(3) (1976) 348–349.
R. Crandall, Some notes on steganography, technical report (1998), available at http://dde.binghamton.edu/download/syndrome/.
J. Fridrich and D. Soukal, Matrix embedding for large payloads, IEEE Trans. Inform. Forensics Security 1(3) (2006) 390–395.
T. Helleseth, All binary 3–error–correcting BCH codes of length $2^m-1$ have covering radius 5, IEEE Trans. Inform. Theory 24(2) (1978) 257–258.
J. A. van der Horst and T. Berger, Complete decoding of triple–error–correcting binary BCH codes, IEEE Trans. Inform. Theory 22(2) (1976) 138–147.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error–Correcting Codes, North-Holland Mathematical Library, vol. 16, North-Holland Publishing Company, Amsterdam, 1977.
C. Munuera, Steganography and error–correcting codes, Signal Process. 87(6) (2007) 1528–1533.
A. Westfeld, F5—A steganographic algorithm: High capacity with unable steganalysis, in: I. S. Moskowitz (Ed.), Information Hiding (IH 2001), Lecture Notes in Computer Science, vol. 2137, Springer, Berlin, Heidelberg, 2001, pp. 289–302.
