Interference Channels with Common Information

Simple item page
dc.creatorJiang, Jinhua
dc.creatorXin, Yan
dc.creatorGarg, Hari Krishna
dc.date2006-10-18
dc.date.accessioned2026-07-07T08:16:46Z
dc.date.available2026-07-07T08:16:46Z
dc.descriptionIn 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.
dc.description23 pages, 5 figures, submitted to Trans. Inform. Theory
dc.identifierhttps://arxiv.org/abs/cs/0610107
dc.identifierhttp://arxiv.org/abs/cs/0610107
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133894
dc.subjectInformation Theory
dc.titleInterference Channels with Common Information
dc.typetext

Files

Collections

arXiv