Strong Converse Exponent for State Dependent Channels With Full State Information at the Sender

TL;DR

This paper investigates the decay rate of decoding success probability in state-dependent channels with full state information at the sender when transmitting above capacity, establishing an explicit exponential lower bound.

Contribution

It provides the first explicit lower bound on the strong converse exponent for channels with full state information at the sender, extending understanding of error decay rates.

Findings

Decoding probability decreases exponentially above capacity.

Explicit lower bound for the strong converse exponent derived.

Results extend the theory of state-dependent channel capacities.

Abstract

We consider the state dependent channels with full state information with at the sender. For this state dependent channel, the channel capacity was determined by Gel'fand and Pinsker. In this paper, we study the correct probability of decoding at rates above the capacity. We prove that when the transmission rate is above the capacity this probability goes to zero exponentially and derive an explicit lower bound of this exponent function.