1 Grid Colorings in Steganography Jessica Fridrich and Petr Lisonˇek Abstract— A proper vertex coloring of a graph is called

First Page		Document Content
Date: 2006-12-11 09:55:35 Theoretical computer science Computer arithmetic Discrete mathematics Hamming code Steganography Graph coloring Hamming Coding theory Mathematics Error detection and correction		1 Grid Colorings in Steganography Jessica Fridrich and Petr Lisonˇek Abstract— A proper vertex coloring of a graph is called Add to Reading List Source URL: www.ws.binghamton.edu Download Document from Source Website File Size: 86,89 KB Share Document on Facebook