Information hiding by coverings

F. Galand, G. Kabatiansky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

90 Citations (Scopus)


We propose a formal model for embedding information in black and white images and prove the equivalence between the existence of embedding schemes and covering codes. An asymptotically tight bound on the performance of embedding schemes is given. We construct efficient embedding schemes via known coverings. In particular, one of those schemes allows the embedding of up to ⌊log2(n+1)⌋ bits in coverwords of n bits, changing at most one bit, which is twice as good as the scheme of Y.-Y. Chen et al. (see Proc. IEEE Symp. on Computers and Communication-ISCC 2000, p.750-5, 2000). We rewrite some previous schemes with a look towards their covering structures. Finally, we address the problem of active warden in a similar way, giving a model, establishing the relationship with centered codes and concluding by a construction of schemes resistant to active warden.

Original languageEnglish
Title of host publicationProceedings - 2003 IEEE Information Theory Workshop, ITW 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages4
ISBN (Electronic)0780377990, 9780780377998
Publication statusPublished - 2003
Externally publishedYes
Event2003 IEEE Information Theory Workshop, ITW 2003 - Paris, France
Duration: 31 Mar 20034 Apr 2003

Publication series

NameProceedings - 2003 IEEE Information Theory Workshop, ITW 2003


Conference2003 IEEE Information Theory Workshop, ITW 2003


Dive into the research topics of 'Information hiding by coverings'. Together they form a unique fingerprint.

Cite this