Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
3264 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 7, JULY 2009 Random-Coding Lower Bounds for the Error
 

Summary: 3264 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 7, JULY 2009
Random-Coding Lower Bounds for the Error
Exponent of Joint Quantization and Watermarking
Systems
Yangfan Zhong, Fady Alajaji, Senior Member, IEEE, and Tamás Linder, Senior Member, IEEE
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 memory-
less 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.
Index Terms--Capacity region, error exponent, Gaussian-type
class, information hiding, joint quantization and watermarking,
private watermarking, random-coding lower bound.
I. INTRODUCTION
WATERMARKING (or information hiding) is the
process of embedding a secret source message (water-

  

Source: Alajaji, Fady - Department of Mathematics and Statistics, Queen's University (Kingston)
Linder, Tamás - Department of Mathematics and Statistics, Queen's University (Kingston)

 

Collections: Engineering