IEICE TRANSACTIONS on Fundamentals
On the Condition of ε-Transmissible Joint Source-Channel Coding for General Sources and General Channels
Summary :
The joint source-channel coding problem is considered. The joint source-channel coding theorem reveals the existence of a code for the pair of the source and the channel under the condition that the error probability is smaller than or equal to ε asymptotically. The separation theorem guarantees that we can achieve the optimal coding performance by using the two-stage coding. In the case that ε = 0, Han showed the joint source-channel coding theorem and the separation theorem for general sources and channels. Furthermore the ε-coding theorem (0 ≤ ε <1) in the similar setting was studied. However, the separation theorem was not revealed since it is difficult in general. So we consider the separation theorem in this setting.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E92-A No.11 pp.2936-2940
- Publication Date
- 2009/11/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E92.A.2936
- Type of Manuscript
- LETTER
- Category
- Information Theory
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
Ryo NOMURA, Toshiyasu MATSUSHIMA, Shigeichi HIRASAWA, "On the Condition of ε-Transmissible Joint Source-Channel Coding for General Sources and General Channels" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 11, pp. 2936-2940, November 2009, doi: 10.1587/transfun.E92.A.2936.
Abstract: The joint source-channel coding problem is considered. The joint source-channel coding theorem reveals the existence of a code for the pair of the source and the channel under the condition that the error probability is smaller than or equal to ε asymptotically. The separation theorem guarantees that we can achieve the optimal coding performance by using the two-stage coding. In the case that ε = 0, Han showed the joint source-channel coding theorem and the separation theorem for general sources and channels. Furthermore the ε-coding theorem (0 ≤ ε <1) in the similar setting was studied. However, the separation theorem was not revealed since it is difficult in general. So we consider the separation theorem in this setting.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.2936/_p
Copy
@ARTICLE{e92-a_11_2936,
author={Ryo NOMURA, Toshiyasu MATSUSHIMA, Shigeichi HIRASAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Condition of ε-Transmissible Joint Source-Channel Coding for General Sources and General Channels},
year={2009},
volume={E92-A},
number={11},
pages={2936-2940},
abstract={The joint source-channel coding problem is considered. The joint source-channel coding theorem reveals the existence of a code for the pair of the source and the channel under the condition that the error probability is smaller than or equal to ε asymptotically. The separation theorem guarantees that we can achieve the optimal coding performance by using the two-stage coding. In the case that ε = 0, Han showed the joint source-channel coding theorem and the separation theorem for general sources and channels. Furthermore the ε-coding theorem (0 ≤ ε <1) in the similar setting was studied. However, the separation theorem was not revealed since it is difficult in general. So we consider the separation theorem in this setting.},
keywords={},
doi={10.1587/transfun.E92.A.2936},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - On the Condition of ε-Transmissible Joint Source-Channel Coding for General Sources and General Channels
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2936
EP - 2940
AU - Ryo NOMURA
AU - Toshiyasu MATSUSHIMA
AU - Shigeichi HIRASAWA
PY - 2009
DO - 10.1587/transfun.E92.A.2936
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2009
AB - The joint source-channel coding problem is considered. The joint source-channel coding theorem reveals the existence of a code for the pair of the source and the channel under the condition that the error probability is smaller than or equal to ε asymptotically. The separation theorem guarantees that we can achieve the optimal coding performance by using the two-stage coding. In the case that ε = 0, Han showed the joint source-channel coding theorem and the separation theorem for general sources and channels. Furthermore the ε-coding theorem (0 ≤ ε <1) in the similar setting was studied. However, the separation theorem was not revealed since it is difficult in general. So we consider the separation theorem in this setting.
ER -
English
