Noisy network coding approach to the relay channel with a random state
2011 (English)In: 2011 45th Annual Conference on Information Sciences and Systems, CISS 2011, 2011, 1-5 p.Conference paper (Refereed)
We consider the three-node relay channel with a random state. We assume that noncausal knowledge of the random state is partially known at the nodes. We present an achievable rate based on the noisy network coding (NNC) and the Gelfand-Pinsker random binning strategies. We then compare the achievable rate of NNC with that of compress-and-forward.
Place, publisher, year, edition, pages
2011. 1-5 p.
Achievable rate, Compress and forward, Random binning, Random state, Relay channels
IdentifiersURN: urn:nbn:se:kth:diva-59953DOI: 10.1109/CISS.2011.5766225ScopusID: 2-s2.0-79957841147ISBN: 978-142449847-5OAI: oai:DiVA.org:kth-59953DiVA: diva2:476779
2011 45th Annual Conference on Information Sciences and Systems, CISS 2011; Baltimore, MD; 23 March 2011 through 25 March 2011
QC 201201232012-01-122012-01-122012-01-23Bibliographically approved