Download now Free registration required
In this paper, the authors consider a state dependent channel with one transmitter, Alice, and two receivers, Bob and Eve. The problem is to effectively convey ("Amplify") the channel state sequence to Bob while "Masking" it from Eve. The extent to which the state sequence cannot be masked from Eve is referred to as leakage. This can be viewed as a secrecy problem, where they desire that the channel state itself be minimally leaked to Eve while being communicated to Bob. The paper is aimed at characterizing the trade-off region between amplification and leakage rates for such a system. An achievable coding scheme is presented, wherein the transmitter transmits partial state information over the channel to facilitate the amplification process.
- Format: PDF
- Size: 286.17 KB