Coding for Channels With Rate-Limited Side Information at the Decoder, With Applications

In this work, coding for channel with partial state information at the decoder is studied. Specifically, the model under consideration assumes that the encoder is provided with full channel state information (CSI) in a noncausal manner, and the decoder is provided with partial state knowledge, quantified by a rate limit. Coding of side information intended for the channel decoder is a Wyner-Ziv like problem, since the channel output depends statistically on the state, thus serving as side information in retrieving the encoded state. Therefore, coding for such a channel involves the simultaneous solution of a Wyner-Ziv problem and a related Gel'fand-Pinsker problem. A single-letter characterization of the capacity of this channel is developed, that involves two rate constraints, in the form of Wyner-Ziv and Gel'fand-Pinsker formulas. Applications are suggested to watermarking problems, where a compressed version of the host signal is present at the decoder. Two main models are examined: the standard watermarking problem, where the decoder is interested only in the embedded information, and the reversible information embedding problem, where the decoder is interested also in exact reproduction of the host. For both problems, single-letter characterizations of the region of all achievable rate-distortion triples (R, Rd, D) are given, where R is the embedding rate, Rd is the rate limit of the compressed host at the decoder, and D is the average distortion between the host and the composite data set (stegotext). For reversible information embedding, two stages of attack are considered, modeled by a degraded broadcast channel, where the weaker (degraded) channel represents the second attack, and both decoders are required to fully reproduce the host.

[1]  Jessica J. Fridrich,et al.  Lossless data embedding for all image formats , 2002, IS&T/SPIE Electronic Imaging.

[2]  Shlomo Shamai,et al.  On channels with partial channel state information at the transmitter , 2005, IEEE Transactions on Information Theory.

[3]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[4]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[5]  Ton Kalker,et al.  Capacity bounds and constructions for reversible data-hiding , 2003, IS&T/SPIE Electronic Imaging.

[6]  Joseph A. O'Sullivan,et al.  Information-theoretic analysis of information hiding , 2003, IEEE Trans. Inf. Theory.

[7]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[8]  Neri Merhav,et al.  On joint information embedding and lossy compression in the presence of a stationary memoryless attack channel , 2004, IEEE Transactions on Information Theory.

[9]  Ton Kalker,et al.  Coding Theorems for Reversible Embedding , 2003, Advances in Network Information Theory.

[10]  F. Willems,et al.  Capacity bounds and constructions for reversible data-hiding , 2002, 2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628).

[11]  Abbas El Gamal,et al.  On the capacity of computer memory with defects , 1983, IEEE Trans. Inf. Theory.

[12]  Neri Merhav,et al.  On joint information embedding and lossy compression , 2005, IEEE Transactions on Information Theory.

[13]  J. Nicholas Laneman,et al.  Reversible Information Embedding in Multi-User Channels ∗ , 2005 .

[14]  Shlomo Shamai,et al.  Achievable rates for the broadcast channel with states known at the transmitter , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[15]  J.A. O'Sullivan,et al.  Information theoretic analysis of steganography , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[16]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[17]  Ingemar J. Cox,et al.  Watermarking as communications with side information , 1999, Proc. IEEE.

[18]  Yossef Steinberg,et al.  Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information , 2005, IEEE Transactions on Information Theory.

[19]  Ingemar J. Cox,et al.  Watermarking as communications with side information : Identification and protection of multimedia information , 1999 .