IEICE TRANSACTIONS on Communications
The Achievable Rate-Distortion Region for Distributed Source Coding with One Distortion Criterion and Correlated Messages
Summary :
In this letter, distributed source coding with one distortion criterion and correlated messages is considered. This problem can be regarded as “Berger-Yeung problem with correlated messages”. It corresponds to the source coding part of the graph-based framework for transmission of a pair of correlated sources over the multiple-access channel where one is lossless and the other is lossy. As a result, the achievable rate-distortion region for this problem is provided. A rigorous proof of both achievability and converse part is also given.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E95-B No.9 pp.2914-2917
- Publication Date
- 2012/09/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E95.B.2914
- Type of Manuscript
- LETTER
- Category
- Fundamental Theories for Communications
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Suhan CHOI, Hichan MOON, "The Achievable Rate-Distortion Region for Distributed Source Coding with One Distortion Criterion and Correlated Messages" in IEICE TRANSACTIONS on Communications,
vol. E95-B, no. 9, pp. 2914-2917, September 2012, doi: 10.1587/transcom.E95.B.2914.
Abstract: In this letter, distributed source coding with one distortion criterion and correlated messages is considered. This problem can be regarded as “Berger-Yeung problem with correlated messages”. It corresponds to the source coding part of the graph-based framework for transmission of a pair of correlated sources over the multiple-access channel where one is lossless and the other is lossy. As a result, the achievable rate-distortion region for this problem is provided. A rigorous proof of both achievability and converse part is also given.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.2914/_p
Copy
@ARTICLE{e95-b_9_2914,
author={Suhan CHOI, Hichan MOON, },
journal={IEICE TRANSACTIONS on Communications},
title={The Achievable Rate-Distortion Region for Distributed Source Coding with One Distortion Criterion and Correlated Messages},
year={2012},
volume={E95-B},
number={9},
pages={2914-2917},
abstract={In this letter, distributed source coding with one distortion criterion and correlated messages is considered. This problem can be regarded as “Berger-Yeung problem with correlated messages”. It corresponds to the source coding part of the graph-based framework for transmission of a pair of correlated sources over the multiple-access channel where one is lossless and the other is lossy. As a result, the achievable rate-distortion region for this problem is provided. A rigorous proof of both achievability and converse part is also given.},
keywords={},
doi={10.1587/transcom.E95.B.2914},
ISSN={1745-1345},
month={September},}
Copy
TY - JOUR
TI - The Achievable Rate-Distortion Region for Distributed Source Coding with One Distortion Criterion and Correlated Messages
T2 - IEICE TRANSACTIONS on Communications
SP - 2914
EP - 2917
AU - Suhan CHOI
AU - Hichan MOON
PY - 2012
DO - 10.1587/transcom.E95.B.2914
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2012
AB - In this letter, distributed source coding with one distortion criterion and correlated messages is considered. This problem can be regarded as “Berger-Yeung problem with correlated messages”. It corresponds to the source coding part of the graph-based framework for transmission of a pair of correlated sources over the multiple-access channel where one is lossless and the other is lossy. As a result, the achievable rate-distortion region for this problem is provided. A rigorous proof of both achievability and converse part is also given.
ER -
English
