Coset codes for compound multiple access channels with common information

This paper considers code construction for arbitrary discrete memoryless compound multiple access channels (MACs) with common information. This class of channels includes a MAC with/without common messages or with partially cooperating encoders. A construction method of code ensembles based on coset codes is proposed for these channels. Assuming joint maximum likelihood decoding, the performance of the proposed code ensemble is analyzed by deriving error exponents. A condition is shown such that codes achieve the capacity region on average. The result obtained here reduces to the result of Slepian and Wolf or other conventional works if restricted to a single MAC. A combination of good linear codes gives capacity achieving codes for compound MACs with common messages or with partially cooperating encoders.