TY - GEN
T1 - The capacity region of the binary dirty MAC
AU - Philosof, Tal
AU - Zamir, Ram
AU - Erez, Uri
PY - 2009/12/7
Y1 - 2009/12/7
N2 - The general two-user memoryless multiple-access channel with partial or full channel state information among the encoders has no single-letter solution which explicitly characterizes its capacity region. In this paper a binary dirty multipleaccess channel with interference known at one/both encoders is considered. Specifically, we derive formulas for the capacity region of the doubly-dirty multiple-access channel where each encoder knows one of two independent interference sequences and for the binary dirty multiple-access channel with a single informed user where the interference is known to only one encoder.
AB - The general two-user memoryless multiple-access channel with partial or full channel state information among the encoders has no single-letter solution which explicitly characterizes its capacity region. In this paper a binary dirty multipleaccess channel with interference known at one/both encoders is considered. Specifically, we derive formulas for the capacity region of the doubly-dirty multiple-access channel where each encoder knows one of two independent interference sequences and for the binary dirty multiple-access channel with a single informed user where the interference is known to only one encoder.
UR - http://www.scopus.com/inward/record.url?scp=76249098708&partnerID=8YFLogxK
U2 - 10.1109/ITW.2009.5351436
DO - 10.1109/ITW.2009.5351436
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:76249098708
SN - 9781424449835
T3 - 2009 IEEE Information Theory Workshop, ITW 2009
SP - 273
EP - 277
BT - 2009 IEEE Information Theory Workshop, ITW 2009
T2 - 2009 IEEE Information Theory Workshop, ITW 2009
Y2 - 11 October 2009 through 16 October 2009
ER -