Steganography via covering codes

Fabien Galand, Gregory Kabatiansky

Research output: Contribution to journalConference articlepeer-review

5 Citations (Scopus)


We prove the equivalence of the embedding problem in two-color images and problems related to coverings in both passive and active adversary models, respectively the covering of binary Hamming space and the centered error-correcting codes. In both cases we give bounds and constructions.

Original languageEnglish
Pages (from-to)192
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 2003
Externally publishedYes
EventProceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: 29 Jun 20034 Jul 2003


Dive into the research topics of 'Steganography via covering codes'. Together they form a unique fingerprint.

Cite this