Exponential Strong Converse for One Helper Source Coding Problem

• Main Author: Yasutada Oohama
• Format: Article
• Language: English
• Published: MDPI AG 2019-06-01
• Series: Entropy
• Subjects: one helper source coding problem; strong converse theorem; exponent of correct probability of decoding
• Online Access: https://www.mdpi.com/1099-4300/21/6/567

We consider the one helper source coding problem posed and investigated by Ahlswede, K&#246;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 <i>n</i> 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.