Coding for the Bidirectional Broadcast Channel with Random States known at the Encoder
2009 (English)In: 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, NEW YORK: IEEE , 2009, 2013-2017 p.Conference paper (Refereed)
In this work, coding for a discrete memoryless broadcast channel with random states and two receivers is studied. Each receiver knows one of the two information sources at the sender and wants to know the other one. Since it is assumed that the sender knows the channel state sequence non-causally, an achievable rate region using Gel'fand-Pinsker-coding is derived. Further, a simple outer bound to the capacity region as well as convexity and cardinality properties regarding the input probability distributions are discussed. The problem is motivated by the application of bidirectional communication between two terminals in a cellular system.
Place, publisher, year, edition, pages
NEW YORK: IEEE , 2009. 2013-2017 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-28933DOI: 10.1109/ISIT.2009.5205608ISI: 000280141401116ScopusID: 2-s2.0-70449508049ISBN: 978-1-4244-4312-3OAI: oai:DiVA.org:kth-28933DiVA: diva2:399664
QC 201102232011-02-232011-01-252011-12-16Bibliographically approved