Oohama Yasutada
Department of Communication Engineering and Informatics, University of Electro-Communications, Tokyo 182-8585, Japan.
Entropy (Basel). 2019 Jun 5;21(6):567. doi: 10.3390/e21060567.
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 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.
我们考虑由阿尔斯韦德（Ahlswede）、克纳（Körner）和怀纳（Wyner）提出并研究的单辅助源编码问题。两个相关源被分别编码并发送到一个目的地，在那里解码器希望以任意小的解码错误概率解码两个源中的一个。在这个系统中，随着源块长度趋于无穷大，解码错误概率趋于1。这意味着我们有一个关于单辅助源编码问题的强逆定理。在本文中，我们为单辅助源编码问题提供了这个强逆定理的更强版本。我们证明了解码错误概率呈指数趋于1，并推导了这个指数函数的一个显式下界。
