The Gaussian watermarking game

IEEE Transactions on Information Theory

Volumn 48, Issue 6, 2002, Pages 1639-1667

  Cohen, Aaron S ^a,b,c   Lapidoth, Amos ^a,b,d  

^a IEEE   (United States)

^b USA   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d ETH ZURICH   (Switzerland)

Author keywords

Additive attack; Capacity; Costa; Dirty paper; Distortion; Game; Gaussian; Mean squared error; Private watermarking; Public watermarking; Watermarking

Indexed keywords

GAUSSIAN JAMMMERS; MEAN SQUARED ERROR;

CHANNEL CAPACITY; EMBEDDED SYSTEMS; GAUSSIAN NOISE (ELECTRONIC); PROBABILITY; SIGNAL DISTORTION; SIGNAL ENCODING; THEOREM PROVING; WATERMARKING;

GAME THEORY;

EID: 0036612282     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.1003844     Document Type: Article

References (41)

1. The capacity of the vector Gaussian watermarking game
2. Writing on dirty paper
3. Watermarking digital image and video data: A state-of-the-art overview
4. Information hiding - A survey
5. Multimedia data-embedding and watermarking technology
6. Information theoretic analysis of steganography
7. Information-theoretic analysis of information hiding
8. On random coding error exponents of watermarking systems
9. On the error exponent and capacity games of private watermarking systems
10. Identification in the presence of side information with application to watermarking
11. Capacity issues in digital image watermarking
12. Quantization index modulation: A class of provably good methods for digital watermarking and information embedding
13. Relationship between quantization and distribution rates of digitally watermarked data
14. Conflict between state information and intended information
15. Nearest neighbour decoding for additive non-Gaussian noise channels
16. A coding theorem for the discrete memoryless broadcast channel
17. Coding for channel with random parameters
18. On the capacity of computer memory with defects
19. Gaussian arbitrarily varying channels
20. Arbitrarily varying channels with constrained inputs and states
21. Watermarking as communications with side information
22. Some properties of optimal information hiding and information attacks
23. Reliable communication under channel uncertainty
24. A strong version of the redundancy-capacity theorem of universal coding
25. Writing on colored paper
26. Capacity and lattice-strategies for cancelling known interference
27. Nested linear/lattice codes for structured multiterminal binning
28. Capacity of the discrete-time Gaussian channel with intersymbol interference
29. Probability of error for optimal codes in a Gaussian channel
30. Random packings and coverings of the unit n-sphere
31. Systematic lossy source/channel coding
32. Nonlinear limits to the information capacity of optical fiber communications