K-user Interference Channels: Achievable Secrecy Rate and Degrees of Freedom
Xiang He, Aylin Yener

TL;DR
This paper investigates achievable secrecy rates and degrees of freedom in symmetric K-user interference channels, demonstrating the effectiveness of nested lattice and layered coding in enhancing secrecy and capacity.
Contribution
It introduces new achievable secrecy rates using nested lattice and layered coding, and derives secure degrees of freedom for various channel parameters.
Findings
Nested lattice codes improve secrecy in K-user interference channels.
Achievable secrecy rates are established for very strong interference.
Nested lattice codes increase degrees of freedom even without secrecy constraints.
Abstract
In this work, we consider achievable secrecy rates for symmetric -user () 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
