Strong Converse for the State Dependent Channel

We consider the coding problem for the state dependent channel with full state information at the sender and partial state information at the receiver. For this state dependent channel, the channel capacity under rate constraint on the state information at the decoder was determined by Steinberg. In this paper we prove the strong converse theorem for the problem. To prove this theorem, we use a new method, which is a coupling of information spectrum method with the change of measure method introduced by Tyagi and Watanabe.