Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Coverings, centered codes, and combinatorial steganography

Coverings, centered codes, and combinatorial steganography 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

Coverings, centered codes, and combinatorial steganography

Loading next page...
1
 
/lp/springer_journal/coverings-centered-codes-and-combinatorial-steganography-PlHtg6Uj8F

References (15)

Publisher
Springer Journals
Copyright
Copyright © 2009 by Pleiades Publishing, Ltd.
Subject
Engineering; Systems Theory, Control; Information Storage and Retrieval; Electrical Engineering; Communications Engineering, Networks
ISSN
0032-9460
eISSN
1608-3253
DOI
10.1134/S0032946009030107
Publisher site
See Article on Publisher Site

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.

Journal

Problems of Information TransmissionSpringer Journals

Published: Oct 23, 2009

There are no references for this article.