Inner and Outer Bounds for the Public Information Embedding Capacity Region Under Multiple Access Attacks
classification
💻 cs.IT
math.IT
keywords
embeddingboundscapacitycovertextsgiveninformationinnerouter
read the original abstract
We consider a public multi-user information embedding (watermarking) system in which two messages (watermarks) are independently embedded into two correlated covertexts and are transmitted through a multiple-access attack channel. The tradeoff between the achievable embedding rates and the average distortions for the two embedders is studied. For given distortion levels, inner and outer bounds for the embedding capacity region are obtained in single-letter form. Tighter bounds are also given for independent covertexts.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.