Error exponents for watermarking game with squared-error constraints

Tie Liu, Pierre Moulin

Research output: Contribution to journalConference article

Abstract

An overview is given of an error-exponent game for the following two popular systems: spread-spectrum (SS) watermarking with nearest-neighbor decoding, and quantization-index-modulation (QIM) watermarking with lattice decoding. It is shown that in both systems, the optimal attack has the same distribution. A closed-form expression for the error is also given.

Original languageEnglish (US)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - Oct 20 2003
EventProceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: Jun 29 2003Jul 4 2003

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Error exponents for watermarking game with squared-error constraints'. Together they form a unique fingerprint.

  • Cite this