Exponential Strong Converse for One Helper Source Coding Problem
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....
Main Author: | Yasutada Oohama |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-06-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/21/6/567 |
Similar Items
-
Exponential Strong Converse for Source Coding with Side Information at the Decoder
by: Yasutada Oohama
Published: (2018-05-01) -
Information Theoretic Security for Shannon Cipher System under Side-Channel Attacks <sup>†</sup>
by: Bagus Santoso, et al.
Published: (2019-05-01) -
Information Theoretic Security for Broadcasting of Two Encrypted Sources under Side-Channel Attacks <sup>†</sup>
by: Bagus Santoso, et al.
Published: (2019-08-01) -
Source Coding with a Causal Helper
by: Shraga I. Bross
Published: (2020-11-01) -
High-Performance Decoder Architectures For Low-Density Parity-Check Codes
by: Zhang, Kai
Published: (2012)