Exponent Function for One Helper Source Coding Problem at Rates outside the Rate Region

2015/04/22 by Oohama, Yasutada
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1504.05891

Abstract

We consider the one helper source coding problem posed and investigated by Ahlswede, Körner and Wyner. 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 a 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

• Exponent Function for Source Coding with Side Information at the Decoder at Rates below the Rate Distortion Function
• An Iterative Algorithm for Computing the Optimal Exponent of Correct Decoding Probability for Rates below the Rate Distortion Function
• Exponential Error Bounds for Information Bottleneck Source Coding Problems
• Improved Source Coding Exponents via Witsenhausen's Rate
• Exponent Function for Stationary Memoryless Channels with Input Cost at Rates above the Capacity