A New Inequality Related to Proofs of Strong Converse Theorems for Source or Channel Networks

2019/01/15 by Yasutada Oohama, Oohama, Yasutada
Computer Science · Engineering · #Cooperative Communication and Network Coding #Energy Harvesting in Wireless Networks #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.1901.04968

openalex publication_date 2019/01/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we provide a new inequality useful for the proofs of strong converse theorems in the multiterminal 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((1)/(√(n))) on the length n of source outputs.

Related

• Tight Exponential Strong Converses for Lossy Source Coding with Side-Information and Distributed Function Computation
• Outer Bounds for Multiterminal Source Coding via a Strong Data Processing Inequality
• Strong Converses using Typical Changes of Measures and Asymptotic Markov Chains
• Strong Converse using Change of Measure Arguments
• Tight Exponential Strong Converse for Source Coding Problem with Encoded Side Information