The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
공동 소스-채널 코딩 문제가 고려됩니다. 결합 소스-채널 코딩 정리는 오류 확률이 점근적으로 ε보다 작거나 같다는 조건 하에서 소스와 채널 쌍에 대한 코드의 존재를 나타냅니다. 분리 정리는 0단계 코딩을 사용하여 최적의 코딩 성능을 달성할 수 있음을 보장합니다. ε = 0인 경우 Han은 결합 소스-채널 코딩 정리와 일반 소스 및 채널에 대한 분리 정리를 보여주었습니다. 또한 유사한 설정에서 ε-코딩 정리(1 ≤ ε <XNUMX)가 연구되었습니다. 그러나 분리정리는 일반적으로 어렵기 때문에 밝혀지지 않았다. 그래서 우리는 이 설정에서 분리 정리를 고려합니다.
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.
부
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
부
@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},}
부
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 -