Date Added: May 2010
In this paper, the authors consider a three-terminal state-dependent Relay Channel (RC) with the channel state non-causally available at only the relay. Such a model may be useful for designing cooperative wireless networks with some terminals equipped with cognition capabilities, i.e., the relay in their setup. In the Discrete Memoryless (DM) case, they establish lower and upper bounds on channel capacity. The lower bound is obtained by a coding scheme at the relay that uses a combination of codeword splitting, Gel'fand - Pinsker binning, and Decode-and-Forward (DF) relaying. The upper bound improves upon that obtained by assuming that the channel state is available at the source, the relay, and the destination.