A Converse Bound on Wyner-Ahlswede-Körner Network via Gray-Wyner Network

2017/04/07 by Watanabe, Shun · 1 citation
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1704.02262

Abstract

We show a reduction method to construct a code for the Gray-Wyner (GW) network from a given code for the Wyner-Ahlswede-Körner (WAK) network. By combining this reduction with a converse bound on the GW network, we derive a converse bound on the WAK network. The derived bound gives an alternative proof of the strong converse theorem for the WAK network.

Cited by

• Exponential Error Bounds for Information Bottleneck Source Coding Problems

Related

• A New Inequality Related to Proofs of Strong Converse Theorems for Source or Channel Networks
• Mutual Information Bounds for Lossy Common Information
• Lower bound on Wyner's Common Information
• Tight Exponential Strong Converses for Lossy Source Coding with Side-Information and Distributed Function Computation
• Strong Converse Theorems for Multimessage Networks with Tight Cut-Set Bound