Channels with State Information and Mismatched Decoding
A single-user state-dependent channel with mismatched decoding is considered. Several setups are studied, which differ by the manner in which the state information is available to the encoder (causally or non-causally), and by the whether or not the decoder is cognizant of the state sequence. We present achievable rates for these channels based on random coding and random binning and we also observe special cases. In the non-causal case (the mismatched Gelfand Pinsker channel we introduced a scheme of Layered binning and calculate the resulting achievable rate. We also study the Gaussian case, that is, the mismatched counterpart of Costa's dirty paper coding, and we show that mismatched Euclidean decoding rules are capacity achieving.
* M.Sc. research supervised by Prof. Anelia Somekh-Baruch