The capacity region of the binary dirty MAC

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 multiple-access 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.