pith. sign in

arxiv: 1006.2769 · v2 · submitted 2010-06-14 · 💻 cs.IT · math.IT

Achievable Rate Regions for Discrete Memoryless Interference Channel with State Information

classification 💻 cs.IT math.IT
keywords rateachievablechannelcodingdiscreteencodinginformationinterference
0
0 comments X
read the original abstract

In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We propose two coding schemes for the discrete memoryless case: simultaneous encoding for the sub-messages in the first one and superposition encoding in the second one, both with rate splitting and Gel'fand-Pinsker coding. The corresponding achievable rate regions are established.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.