# Technical Program

## Paper Detail

Paper Title An Inequality Useful for Proofs of Strong Converse Theorems in Network Information Theory FR3.R5.5 Yasutada Oohama, University of Electro-Communications, Japan Capacity and Upper Bounds Saint Victor, Level 3 Friday, 12 July, 14:30 - 16:10 Friday, 12 July, 15:50 - 16:10 Click here to download the manuscript In this paper we provide a new inequality useful for the proofs of strong converse theorems in the network information theory. We apply this inequality to the recent work by Tyagi and Watanabe on the strong converse theorem for the Wyner-Ziv source coding problem to obtain a new strong converse outer bound. This outer bound deviates from the Wyner-Ziv rate distortion region with the order $O\left(\frac{1}{\sqrt{n}}\right)$ on the length $n$ of source outputs.