Related Experiment Video
Updated: Nov 27, 2025

Following the Dynamics of Structural Variants in Experimentally Evolved Populations
Published on: February 3, 2023
Exponential Strong Converse for One Helper Source Coding Problem
1Department of Communication Engineering and Informatics, University of Electro-Communications, Tokyo 182-8585, Japan.
Abstract:
We consider the one helper source coding problem posed and investigated by Ahlswede, Körner and Wyner. Two correlated sources are separately encoded and are sent to a destination where the decoder wishes to decode one of the two sources with an arbitrary small error probability of decoding. In this system, the error probability of decoding goes to one as the source block length n goes to infinity. This implies that we have a strong converse theorem for the one helper source coding problem. In this paper, we provide the much stronger version of this strong converse theorem for the one helper source coding problem. We prove that the error probability of decoding tends to one exponentially and derive an explicit lower bound of this exponent function.
Related Concept Videos
Introduction to Exponential Functions
Exponential Functions with Base e
Exponential Equations for Modeling Growth
The Binomial Theorem
Exponential Equations with Logarithms: Problem Solving
Weak Base Solutions
