DocumentCode
2003953
Title
Steganography via covering codes
Author
Galand, Fabien ; Kabatiansky, Gregory
Author_Institution
Project CODES, Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay, France
fYear
2003
fDate
29 June-4 July 2003
Firstpage
192
Abstract
We prove the equivalence of the embedding problem in two-color images and problems related to coverings in both passive and active adversary models, respectively the covering of binary Hamming space and the centered error-correcting codes. In both cases we give bounds and constructions.
Keywords
Hamming codes; cryptography; data encapsulation; error correction codes; image coding; binary Hamming space; centered error-correcting code; embedding problem; steganography; two-color image; Error correction codes; H infinity control; Parity check codes; Redundancy; Steganography; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN
0-7803-7728-1
Type
conf
DOI
10.1109/ISIT.2003.1228206
Filename
1228206
Link To Document