An Achievable Rate Region for Interference Channels with Conferencing

Simple item page
dc.creatorCao, Yi
dc.creatorChen, Biao
dc.date2007-04-14
dc.date.accessioned2026-07-07T08:15:56Z
dc.date.available2026-07-07T08:15:56Z
dc.descriptionIn this paper, we propose an achievable rate region for discrete memoryless interference channels with conferencing at the transmitter side. We employ superposition block Markov encoding, combined with simultaneous superposition coding, dirty paper coding, and random binning to obtain the achievable rate region. We show that, under respective conditions, the proposed achievable region reduces to Han and Kobayashi achievable region for interference channels, the capacity region for degraded relay channels, and the capacity region for the Gaussian vector broadcast channel. Numerical examples for the Gaussian case are given.
dc.description5 pages, 2 figures, accepted by ISIT'07
dc.identifierhttps://arxiv.org/abs/0704.1873
dc.identifierhttp://arxiv.org/abs/0704.1873
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133613
dc.subjectInformation Theory
dc.titleAn Achievable Rate Region for Interference Channels with Conferencing
dc.typetext

Files

Collections

arXiv