Grid colorings in steganography

IEEE Transactions on Information Theory

Volumn 53, Issue 4, 2007, Pages 1547-1549

  Fridrich, Jessica ^a   Lisoněk, Petr ^b  

^a State University of New York at Binghamton   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Domatically full graph; Embedding efficiency; Hamming code; Pixel pooling; Steganography; Syndrome coding

Indexed keywords

COMPUTER APPLICATIONS; GRAPHIC METHODS; HAMMING DISTANCE; PIXELS;

HAMMING CODE; STEGANOGRAPHY; SYNDROME CODING; VERTEX COLORING;

ENCODING (SYMBOLS);

EID: 34147102225     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.892768     Document Type: Article

References (8)

1. C. Berge, "Balanced matrices," Math. Program., vol. 2, pp. 19-31, 1972.
2. J. Bierbrauer, personal communication, 1998. [Online]. Available: http://www.ws.binghamton.edu/fridrich/covcodes.pdf
3. E. J. Cockayne and S. T. Hedetniemi, "Towards a theory of domination in graphs," Networks, vol. 7, pp. 247-261, 1977.
4. M. van Dijk and F. Willems, "Embedding information in grayscale images," in Proc. 22nd Symp. Inf. Theory Benelux, Enschede, The Netherlands, May 15-16, 2001, pp. 147-154.
5. J. Fridrich, P. Lisoněk, and D. Soukal, "On steganographic embedding efficiency," in Proc. 8th Inf. Hiding Workshop, ser. Lecture Notes in Computer Science. Alexandria, VA: Springer, Jul. 10-12, 2006.
6. F. Galand and G. Kabatiansky, "Information hiding by coverings," in Proc. 2003 IEEE Inf. Theory Workshop, Paris, France, pp. 151-154.
7. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
8. D. Soukal, J. Fridrich, and M. Goljan, "Maximum likelihood estimation of secret message length embedded using PMK steganography in spatial domain," in Proc. SPIE, Electron. Imag., Security, Steganogr., Watermarking of Multimedia Contents VII, San Jose, CA, Jan. 16-20, 2005, vol. 5681, pp. 595-606.