Interference Channels With Common Information

From MaRDI portal
Publication:3604559

DOI10.1109/TIT.2007.911257zbMATH Open1305.94028arXivcs/0610107MaRDI QIDQ3604559FDOQ3604559


Authors: Jin-Hua Jiang, Yan Xin, Hari K. Garg Edit this on Wikidata


Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: In this paper, we consider the discrete memoryless interference channel with common information, in which two senders need deliver not only private messages but also certain common messages to their corresponding receivers. We derive an achievable rate region for such a channel by exploiting a random coding strategy, namely cascaded superposition coding. We reveal that the derived achievable rate region generalizes some important existing results for the interference channels with or without common information. Furthermore, we specialize to a class of deterministic interference channels with common information, and show that the derived achievable rate region is indeed the capacity region for this class of channels.


Full work available at URL: https://arxiv.org/abs/cs/0610107




Recommendations





Cited In (4)





This page was built for publication: Interference Channels With Common Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604559)