Loading [a11y]/accessibility-menu.js
Strong Converse for the State Dependent Channel | IEEE Conference Publication | IEEE Xplore

Strong Converse for the State Dependent Channel


Abstract:

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 dep...Show More

Abstract:

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.
Date of Conference: 21-26 June 2020
Date Added to IEEE Xplore: 24 August 2020
ISBN Information:

ISSN Information:

Conference Location: Los Angeles, CA, USA

References

References is not available for this document.