A coding theorem for the discrete memoryless compound multiple access channel with common message and generalized feedback

In this paper, we characterize an achievable rate region for the two-user discrete memoryless compound Multiple Access Channel (MAC) with common message and with generalized feedback (CMACC-GF). The achievable rate region that we provide is proved using a combination of rate splitting, Superposition Block Markov Encoding (SBME), and backward decoding. It is shown that the derived achievable rate for the CMACC-GF subsumes achievable regions for some classes of multiuser channels such as: the CMACC without feedback, CMACC with output feedback, strong interference channel with common message (SICC) and with generalized/output feedback as well as SICC without feedback.