A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
In this work, we consider achievable secrecy rates for symmetric K-user (K > 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-userdoi:10.1109/itwnit.2009.5158598 dblp:conf/itw/HeY09 fatcat:acquedwn6jfzlfjid4rp7fby7e