Abstract
The state-dependent multiple access channel (MAC) is considered where the state sequences are known strictly causally to the encoders. First, a two-user MAC with two independent states each known strictly causally to one encoder is revisited, and a new achievable scheme inspired by the recently proposed noisy network coding is presented. This scheme is shown to achieve a rate region that is potentially larger than that provided by recent work for the same model. Next, capacity results are presented for a class of channels that include modulo-additive state-dependent MACs. It is shown that the proposed scheme can be easily extended to an arbitrary number of users. Finally, a similar scheme is proposed for a MAC with common state known strictly causally to all encoders. The corresponding achievable rate region is shown to reduce to the one given in the previous work as a special case for two users.
Original language | English |
---|---|
Title of host publication | ISIT 2011 |
Subtitle of host publication | Proceedings of the 2011 IEEE International Symposium on Information Theory |
Place of Publication | Piscataway, NJ |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 2806-2810 |
Number of pages | 5 |
ISBN (Electronic) | 9781457705953, 9781457705946 |
ISBN (Print) | 9781457705960 |
DOIs | |
Publication status | Published - 2011 |
Externally published | Yes |
Event | 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation Duration: 31 Jul 2011 → 5 Aug 2011 |
Other
Other | 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 |
---|---|
Country/Territory | Russian Federation |
City | St. Petersburg |
Period | 31/07/11 → 5/08/11 |