Computer Science – Information Theory
Scientific paper
2009-05-16
Computer Science
Information Theory
5 pages, To appear at IEEE ISIT 2009
Scientific paper
We investigate the $K$-user many-to-one interference channel with confidential messages in which the $K$th user experiences interference from all other $K-1$ users, and is at the same time treated as an eavesdropper to all the messages of these users. We derive achievable rates and an upper bound on the sum rate for this channel and show that the gap between the achievable sum rate and its upper bound is $\log_2(K-1)$ bits per channel use under very strong interference, when the interfering users have equal power constraints and interfering link channel gains. The main contributions of this work are: (i) nested lattice codes are shown to provide secrecy when interference is present, (ii) a secrecy sum rate upper bound is found for strong interference regime and (iii) it is proved that under very strong interference and a symmetric setting, the gap between the achievable sum rate and the upper bound is constant with respect to transmission powers.
He Xiang
Yener Aylin
No associations
LandOfFree
The Gaussian Many-to-One 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-One 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-One Interference Channel with Confidential Messages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-503616