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.
|Number of pages||1|
|Journal||IEEE International Symposium on Information Theory - Proceedings|
|Publication status||Published - 2003|
|Event||Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan|
Duration: 29 Jun 2003 → 4 Jul 2003