How Reed-Solomon codes can improve steganographic schemes
EURASIP Journal on Information Security - Special issue on secure steganography in multimedia content
Generalization of the ZZW embedding construction for steganography
IEEE Transactions on Information Forensics and Security
Improving embedding efficiency by incorporating SDCS and WPC
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Near-optimal codes for information embedding in gray-scale signals
IEEE Transactions on Information Theory
A compact covering method to exploit embedding capacity for matrix encoding
Information Sciences: an International Journal
Interpolation of steganographic schemes
Signal Processing
| Hi-index | 754.90 |
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