Interference Channels with Common Information

Details Interference Channels with Common Information Interference Channels with Common Information

2006-10-18

arxiv.org/abs/cs/0610107v1

Computer Science

Information Theory

23 pages, 5 figures, submitted to Trans. Inform. Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Interference Channels with Common Information 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 Interference Channels with Common Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interference Channels with Common Information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-99411