An Inner Bound on the Capacity Region of Multiple-Access Channel with Side Information

This paper consider the problem of a two user discrete memoryless cooperative multiple-access channel (DM-CMAC) where non-causal side information is available at the encoders. According to this channel model, two users have access to a common message which is transmitted to a destination, while both of them have an individual information intended for the destination respectively. On condition that for the two transimitters, the side information is known non-causally, we apply superposition coding together with Gelfand-Pinsker binning coding schemes to derive the inner bound on the capacity region of this channel model. We compare this result with previous works and subsume them as a special case.