Computer Science – Information Theory
Scientific paper
2009-05-16
Computer Science
Information Theory
5 pages. To appear at IEEE ITW 2009, Volos, June 2009
Scientific paper
In this work, we consider achievable secrecy rates for symmetric $K$-user ($K \ge 3$) interference channels with confidential messages. We find that nested lattice codes and layered coding are useful in providing secrecy for these channels. Achievable secrecy rates are derived for very strong interference. In addition, we derive the secure degrees of freedom for a range of channel parameters. As a by-product of our approach, we also demonstrate that nested lattice codes are useful for K-user symmetric interference channels without secrecy constraints in that they yield higher degrees of freedom than previous results.
He Xiang
Yener Aylin
No associations
LandOfFree
K-user Interference Channels: Achievable Secrecy Rate and Degrees of Freedom 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 K-user Interference Channels: Achievable Secrecy Rate and Degrees of Freedom, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and K-user Interference Channels: Achievable Secrecy Rate and Degrees of Freedom will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-503632