Strong Converse using Change of Measure Arguments

Tyagi, Himanshu and Watanabe, Shun (2018) Strong Converse using Change of Measure Arguments. In: IEEE International Symposium on Information Theory (ISIT), JUN 17-22, 2018, Vail, CO, pp. 1849-1853.

PDF ISIT_1849_2018.pdf - Published Version Restricted to Registered users only Download (579kB) | Request a copy

Abstract

The strong converse for a coding theorem shows that the optimal asymptotic rate possible with vanishing error cannot be improved by allowing a fixed error. Building on a method introduced by Gu and Effros for centralized coding problems, we develop a general and simple recipe for proving strong converse that is applicable for the distributed problems as well. Heuristically, our proof of strong converse mimics the standard steps for proving a weak converse, except that we apply those steps to a modified distribution obtained by conditioning the original distribution on the event that no error occurs. A key component of our recipe is the replacement of the hard Markov constraints with a soft information cost using a variational formula introduced by Oohama. We illustrate our method by providing a short proof of the strong converse for the Wyner-Ziv problem and a strong converse theorem for the interactive function computation problem; the latter result was not available prior to our work.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE
Additional Information:	Copy right for this article belong to IEEE
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	24 Nov 2018 14:29
Last Modified:	24 Nov 2018 14:29
URI:	http://eprints.iisc.ac.in/id/eprint/61137

Actions (login required)

View Item