Random-coding lower bounds for the error exponent of joint quantization and watermarking systems

  • Authors:
  • Yangfan Zhong;Fady Alajaji;Tamás Linder

  • Affiliations:
  • Bank of Montreal, Toronto, ON, Canada;Department of Mathematics and Statistics, Queen's University, Kingston, ON, Canada;Department of Mathematics and Statistics, Queen's University, Kingston, ON, Canada

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2009

Quantified Score

Hi-index 754.84

Visualization

Abstract

We establish random-coding lower bounds to the error exponent of discrete and Gaussian joint quantization and private watermarking systems. In the discrete system, both the covertext and the attack channel are memoryless and have finite alphabets. In the Gaussian system, the covertext is memoryless Gaussian and the attack channel has additive memoryless Gaussian noise. In both cases, our bounds on the error exponent are positive in the interior of the achievable quantization and watermarking rate region.