Computer Science – Information Theory
Scientific paper
2010-05-04
Computer Science
Information Theory
Submitted to IEEE Transactions on Information Theory, April 2010
Scientific paper
The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general K-user interference channel. In this paper, we introduce information theoretic secrecy to this model and consider the many-to-one interference channel with confidential messages, in which each receiver, in particular, the one subject to interference, is also one from which the interfering users' messages need to be kept secret from. We derive the achievable secrecy sum rate for this channel using nested lattice codes, as well as an upper bound on the secrecy sum rate for all possible channel gain configurations. We identify several nontrivial cases where the gap between the upper bound and the achieved secrecy sum rate is only a function of the number of the users K, and is uniform over all possible channel gain configurations in each case. In addition, we identify the secure degree of freedom for this channel and show it to be equivalent to its degree of freedom, i.e., the secrecy in high SNR comes for free.
He Xiang
Yener Aylin
No associations
LandOfFree
The Gaussian Many-to-1 Interference Channel with Confidential Messages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Gaussian Many-to-1 Interference Channel with Confidential Messages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Gaussian Many-to-1 Interference Channel with Confidential Messages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-435918