A new achievable rate region for the discrete memoryless X channel

  • Authors:
  • O. Ozan Koyluoglu;Mohammad Shahmohammadi;Hesham El Gamal

  • Affiliations:
  • Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH;Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH;Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH

  • Venue:
  • ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.