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.
Published in:
Information Sciences and Systems (CISS), 2011 45th Annual Conference on
Date of Conference: 23-25 March 2011