This article is cited in 3 papers

Information Protection

Coverings, centered codes, and combinatorial steganography

F. Galand^a, G. A. Kabatiansky<sup>b

a</sup> IRISA, Rennes, France
^b A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences

Abstract: 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.

UDC: 621.391.7

Received: 05.06.2009
Revised: 22.06.2009

 English version: Problems of Information Transmission, 2009, 45:3, 289–294

Bibliographic databases:

• 
• 
• 
•