Grid Colorings in Steganography

DOI10.1109/TIT.2007.892768MaRDI QIDQ3548200zbMATH OpenOpenAlexFDO

Authors Jessica Fridrich, Petr Lisoněk

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2007.892768

zbMATH Keywords

grid coloringrainbow coloringsteganography

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Applications of graph theory (05C90) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1867241
• Rainbow regular order of graphs
• Acyclic and \(k\)-distance coloring of the grid
• Rainbowness of plane graphs
• Rainbow coloring the cube

Cited in

(4)

• Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein-Jacobi integers and Lipschitz integers
• Two-point FFT-based high capacity image steganography using calendar based message encoding
• Steganographic schemes from perfect codes on Cayley graphs
• Injective colorings of graphs with low average degree

This page was built for publication: Grid Colorings in Steganography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548200)