On the capacity of a channel with action-dependent state and reversible input
2011 (English)In: IEEE International Symposium on Information Theory - Proceedings, 2011, 331-335 p.Conference paper (Refereed)
We consider a problem of coding for channels with action-dependent states available noncausally to the encoder where the decoder is additionally required to be able to decode the channel input reliably. Lower and upper bounds on the channel capacity are derived. It is shown that the capacity is determined if there exists a maximizing joint probability distribution in the upper bound which satisfies the two-stage coding condition, and it, in turn, reveals the formula duality between this problem and that of source coding with common reconstruction and action-dependent side information. We also state two simple coding schemes and the corresponding achievable rates for the cases where the two-stage coding condition is not fulfilled.
Place, publisher, year, edition, pages
2011. 331-335 p.
IdentifiersURN: urn:nbn:se:kth:diva-52426DOI: 10.1109/ISIT.2011.6034140ISI: 000297465100067ScopusID: 2-s2.0-80054814243ISBN: 978-1-4577-0595-3OAI: oai:DiVA.org:kth-52426DiVA: diva2:466447
2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
FunderEU, FP7, Seventh Framework Programme, 223866Swedish Research Council, A0442801ICT - The Next Generation
QC 201112212011-12-162011-12-162012-06-13Bibliographically approved