Error exponents for watermarking game with squared-error constraints

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 190-

  Liu, Tie ^a   Moulin, Pierre ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODING ERRORS; DECODING; DIGITAL WATERMARKING; MODULATION; OPTIMIZATION; POLES AND ZEROS; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

DECODER; ERROR EXPONENTS; LATTICE DECODING; NEAREST NEIGHBOR DECODING; QUANTIZATION INDEX MODULATION WATERMARKING; SPREAD SPECTRUM WATERMARKING; SQUARED ERROR CONSTRAINTS; WATERMARKING GAMES;

GAME THEORY;

EID: 0142008347     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228204     Document Type: Conference Paper

References (2)

1. H. Malvar and D. Florêncio, "Improved spread spectrum: a new modulation technique for robust watermarking," IEEE Trans. Signal Processing, vol. 51, no. 4, pp. 898-905, April 2003.
2. U. Erez and R. Zamir, "Lattice decoded nested codes achieve the Poltyrev exponent," in Proc. ISIT'02, Lausanne, Switzerland, June-July 2002.