TY - GEN
T1 - Leveraging strictly causal state information at the encoders for multiple access channels
AU - Li, Min
AU - Simeone, Osvaldo
AU - Yener, Aylin
N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=80054809399&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80054809399&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2011.6034086
DO - 10.1109/ISIT.2011.6034086
M3 - Conference contribution
AN - SCOPUS:80054809399
SN - 9781457705953
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2806
EP - 2810
BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Y2 - 31 July 2011 through 5 August 2011
ER -