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

01/15/2019
by   Yasutada Oohama, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/15/2019

A New Inequality Related to Proofs of Strong Converse Theorems in Multiterminal Information Theory

In this paper we provide a new inequality useful for the proofs of stron...
research
09/01/2021

New Proofs of Extremal Inequalities With Applications

The extremal inequality approach plays a key role in network information...
research
07/13/2020

On the Parallel Tower of Hanoi Puzzle: Acyclicity and a Conditional Triangle Inequality

A generalization of the Tower of Hanoi Puzzle—the Parallel Tower of Hano...
research
12/02/2015

Equal-image-size source partitioning: Creating strong Fano's inequalities for multi-terminal discrete memoryless channels

This paper introduces equal-image-size source partitioning, a new tool f...
research
02/18/2020

Vector Gaussian Successive Refinement With Degraded Side Information

We investigate the problem of the successive refinement for Wyner-Ziv co...
research
05/08/2021

Distortion-Based Outer-Bounds for Channels with Rate-Limited Feedback

We present a new technique to obtain outer-bounds on the capacity region...
research
02/01/2021

Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity

In this paper, we introduce the concept of a type graph, namely a bipart...

Please sign up or login with your details

Forgot password? Click here to reset