A New Achievable Rate Region for Multiple-Access Channel with States

2017/02/08 by Heidari, Mohsen, Shirani, Farhad, Pradhan, S. Sandeep
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1702.02330

Abstract

The problem of reliable communication over the multiple-access channel (MAC) with states is investigated. We propose a new coding scheme for this problem which uses quasi-group codes (QGC). We derive a new computable single-letter characterization of the achievable rate region. As an example, we investigate the problem of doubly-dirty MAC with modulo-4 addition. It is shown that the sum-rate R₁+R₂=1 bits per channel use is achievable using the new scheme. Whereas, the natural extension of the Gel'fand-Pinsker scheme, sum-rates greater than 0.32 are not achievable.

Related

• How to Compute Modulo Prime-Power Sums ?
• Achievable Rate Region for Multiple Access Channel with Correlated Channel States and Cooperating Encoders
• On the Capacity of Multiple Access Channels with State Information and Feedback
• Achievable Rate Regions for the Dirty Multiple Access Channel with Partial Side Information at the Transmitters
• The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel