Steganography via covering codes
Fabien Galand, Grigory A. Kabatiansky · 2003
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.