Next Article in Journal
Exploration vs. Data Refinement via Multiple Mobile Sensors
Previous Article in Journal
SIMIT: Subjectively Interesting Motifs in Time Series
Previous Article in Special Issue
Information Theoretic Security for Shannon Cipher System under Side-Channel Attacks
Article Menu

Article Versions

Export Article

Open AccessArticle

Exponential Strong Converse for One Helper Source Coding Problem

Department of Communication Engineering and Informatics, University of Electro-Communications, Tokyo 182-8585, Japan
Entropy 2019, 21(6), 567; https://doi.org/10.3390/e21060567
Received: 12 March 2019 / Revised: 29 May 2019 / Accepted: 31 May 2019 / Published: 5 June 2019
(This article belongs to the Special Issue Multiuser Information Theory II)
PDF [506 KB, uploaded 5 June 2019]

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.
Keywords: one helper source coding problem; strong converse theorem; exponent of correct probability of decoding one helper source coding problem; strong converse theorem; exponent of correct probability of decoding
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Oohama, Y. Exponential Strong Converse for One Helper Source Coding Problem . Entropy 2019, 21, 567.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top