Coverings, centered codes, and combinatorial steganography

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


It is shown that steganography with a given distortion criteria, which we call combinatorial steganography, is equivalent to coverings of Hamming spaces or to so-called centered error-correcting codes, depending on whether an opponent is passive or active, respectively. A construction of centered error-correcting codes based on Reed-Solomon and algebraic geometry codes is proposed.

Original languageEnglish
Pages (from-to)289-294
Number of pages6
JournalProblems of information transmission
Issue number3
Publication statusPublished - 2009
Externally publishedYes


Dive into the research topics of 'Coverings, centered codes, and combinatorial steganography'. Together they form a unique fingerprint.

Cite this