State Amplification Under Masking Constraints

In this paper, the authors consider a state dependent channel with one transmitter, Alice, and two receivers, Bob and Eve. The problem at hand is to effectively "Amplify" the channel state sequence at Bob while "Masking" it from Eve. The extent to which the state sequence cannot be masked from Eve is referred to as leakage, and the paper is aimed at characterizing the tradeoff-region between amplification and leakage rates for such a system. An achievable coding scheme is presented, wherein the transmitter enumerates the state sequence using two indices, and transmits one of the indices over the channel to facilitate the amplification process.

Provided by: University of Teramo Topic: Networking Date Added: Oct 2011 Format: PDF

Find By Topic