Information Rates Subject to State Masking

We consider the problem of rate-R, channel coding with causal/noncausal side information at the transmitter, under an additional requirement of minimizing the amount of information that can be learned from the channel output about the state sequence, which is defined in terms of the mutual information between the state sequence and the channel output sequence. A single-letter characterization is provided for the achievable region of pairs {(R, E)}. Explicit results for the Gaussian case (Costa's dirty-paper channel) are derived in full detail.

[1]  Shlomo Shamai,et al.  On the achievable throughput of a multiantenna Gaussian broadcast channel , 2003, IEEE Transactions on Information Theory.

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

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

[4]  T. Cover,et al.  Rate vs. distortion trade-off for channels with state information , 2002, Proceedings IEEE International Symposium on Information Theory,.

[5]  Chao Tian,et al.  Multiple Description Quantization Via Gram–Schmidt Orthogonalization , 2005, IEEE Transactions on Information Theory.

[6]  Neri Merhav,et al.  On the capacity game of public watermarking systems , 2004, IEEE Transactions on Information Theory.

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

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

[9]  Andrea J. Goldsmith,et al.  PhantomNet: Exploring Optimal Multicellular Multiple Antenna Systems , 2004, EURASIP J. Adv. Signal Process..

[10]  Claude E. Shannon,et al.  Channels with Side Information at the Transmitter , 1958, IBM J. Res. Dev..

[11]  Prakash Narayan,et al.  Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.

[12]  Babak Hassibi,et al.  How much training is needed in multiple-antenna wireless links? , 2003, IEEE Trans. Inf. Theory.

[13]  Shlomo Shamai,et al.  On joint source-channel coding for the Wyner-Ziv source and the Gel'fand-Pinsker channel , 2003, IEEE Trans. Inf. Theory.

[14]  Stephan ten Brink,et al.  A close-to-capacity dirty paper coding scheme , 2004, IEEE Transactions on Information Theory.

[15]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[16]  Mung Chiang,et al.  Tradeoff between message and state information rates , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[17]  Neri Merhav.  On joint coding for watermarking and encryption , 2006, IEEE Transactions on Information Theory.

[18]  Philip A. Whiting,et al.  Rate-splitting multiple access for discrete memoryless channels , 2001, IEEE Trans. Inf. Theory.

[19]  Zixiang Xiong,et al.  Near-capacity dirty-paper code designs based on TCQ and IRA codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[20]  Amos Lapidoth,et al.  The Gaussian watermarking game , 2000, IEEE Trans. Inf. Theory.

[21]  Syed Ali Jafar.  Capacity With Causal and Noncausal Side Information: A Unified View , 2006, IEEE Transactions on Information Theory.

[22]  Mung Chiang,et al.  Channel capacity and state estimation for state-dependent Gaussian channels , 2005, IEEE Transactions on Information Theory.

[23]  Anders Høst-Madsen,et al.  Capacity bounds for Cooperative diversity , 2006, IEEE Transactions on Information Theory.

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

[25]  Helmut Bölcskei,et al.  Space-Time Wireless Systems: From Array Processing to MIMO Communications , 2008 .

[26]  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.