Strong Converse Exponent for State Dependent Channels With Full State Information at the Sender
Information Theory
2020-08-11 v4 math.IT
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.
Keywords
Cite
@article{arxiv.1603.06344,
title = {Strong Converse Exponent for State Dependent Channels With Full State Information at the Sender},
author = {Yasutada Oohama},
journal= {arXiv preprint arXiv:1603.06344},
year = {2020}
}
Comments
The present version has 14 pages and one figure. In the previous version we have a gap on the proof of the main result. In the current version we have fixed the gap for the special case that the state information is not available at the receiver