A new achievable rate region for the discrete memoryless X channel

Onur Ozan Koyluoglu, Mohammad Shahmohammadi, Hesham El Gamal

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

8 Citations (Scopus)

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 publicationIEEE International Symposium on Information Theory - Proceedings
Pages2427-2431
Number of pages5
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Other

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

Fingerprint

Transmitter
Transmitters
Receiver
Binning
Communication
Model

ASJC Scopus subject areas

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

Cite this

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

A new achievable rate region for the discrete memoryless X channel. / Koyluoglu, Onur Ozan; Shahmohammadi, Mohammad; El Gamal, Hesham.

IEEE International Symposium on Information Theory - Proceedings. 2009. p. 2427-2431 5206034.

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

Koyluoglu, OO, Shahmohammadi, M & El Gamal, H 2009, A new achievable rate region for the discrete memoryless X channel. in IEEE International Symposium on Information Theory - Proceedings., 5206034, pp. 2427-2431, 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, Korea, Republic of, 6/28/09. https://doi.org/10.1109/ISIT.2009.5206034
Koyluoglu OO, Shahmohammadi M, El Gamal H. A new achievable rate region for the discrete memoryless X channel. In IEEE International Symposium on Information Theory - Proceedings. 2009. p. 2427-2431. 5206034 https://doi.org/10.1109/ISIT.2009.5206034
Koyluoglu, Onur Ozan ; Shahmohammadi, Mohammad ; El Gamal, Hesham. / A new achievable rate region for the discrete memoryless X channel. IEEE International Symposium on Information Theory - Proceedings. 2009. pp. 2427-2431
@inproceedings{cbe0a0eb3ce64347a832c415818fad9b,
title = "A new achievable rate region for the discrete memoryless X channel",
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.",
author = "Koyluoglu, {Onur Ozan} and Mohammad Shahmohammadi and {El Gamal}, Hesham",
year = "2009",
doi = "10.1109/ISIT.2009.5206034",
language = "English (US)",
isbn = "9781424443130",
pages = "2427--2431",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - A new achievable rate region for the discrete memoryless X channel

AU - Koyluoglu, Onur Ozan

AU - Shahmohammadi, Mohammad

AU - El Gamal, Hesham

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70449514120&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449514120&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2009.5206034

DO - 10.1109/ISIT.2009.5206034

M3 - Conference contribution

AN - SCOPUS:70449514120

SN - 9781424443130

SP - 2427

EP - 2431

BT - IEEE International Symposium on Information Theory - Proceedings

ER -