A new achievable rate region for the discrete memoryless X channel

O. Ozan Koyluoglu, Mohammad Shahmohammadi, Hesham El Gamal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations

Abstract

We consider the discrete memoryless X channel, a communication model with two transmitters and two receivers in which every transmitter has a message for every receiver. We propose an achievable scheme, based on the message splitting and binning techniques, which results in the best inner bound on the capacity region of the X channel to date.

Original languageEnglish (US)
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages2427-2431
Number of pages5
DOIs
StatePublished - Nov 19 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8102

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
CountryKorea, Republic of
CitySeoul
Period6/28/097/3/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A new achievable rate region for the discrete memoryless X channel'. Together they form a unique fingerprint.

  • Cite this

    Koyluoglu, O. O., Shahmohammadi, M., & El Gamal, H. (2009). A new achievable rate region for the discrete memoryless X channel. In 2009 IEEE International Symposium on Information Theory, ISIT 2009 (pp. 2427-2431). [5206034] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2009.5206034