|
Problemy Peredachi Informatsii, 2009, Volume 45, Issue 3, Pages 106–111
(Mi ppi1994)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Information Protection
Coverings, centered codes, and combinatorial steganography
F. Galanda, G. A. Kabatianskyb a 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.
Received: 05.06.2009 Revised: 22.06.2009
Citation:
F. Galand, G. A. Kabatiansky, “Coverings, centered codes, and combinatorial steganography”, Probl. Peredachi Inf., 45:3 (2009), 106–111; Problems Inform. Transmission, 45:3 (2009), 289–294
Linking options:
https://www.mathnet.ru/eng/ppi1994 https://www.mathnet.ru/eng/ppi/v45/i3/p106
|
Statistics & downloads: |
Abstract page: | 1395 | Full-text PDF : | 245 | References: | 78 | First page: | 27 |
|