By Topic

Grid Colorings in Steganography

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fridrich, J. ; Dept. of Electr. & Comput. Eng., State Univ. of New York, Binghamton, NY ; Lisonek, P.

A proper vertex coloring of a graph is called rainbow if, for each vertex v, all neighbors of v receive distinct colors. A k-regular graph G is called rainbow (or domatically full) if it admits a rainbow (k+1)-coloring. The d-dimensional grid graph Gd is the graph whose vertices are the points of Zopfd and two vertices are adjacent if and only if their l1-distance is 1. We use a simple construction to prove that Gd is rainbow for all d ges 1. We discuss an important application of this result in steganography

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 4 )