Algebraic Geometric Codes: Basic Notions
Algebraic Geometric Codes: Basic Notions
Asymptotically optimal perfect steganographic systems
Problems of Information Transmission
On the capacity game of private fingerprinting systems under collusion attacks
IEEE Transactions on Information Theory
Ensuring message embedding in wet paper steganography
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
| Hi-index | 0.00 |
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.