On the Condition of ε-Transmissible Joint Source-Channel Coding for General Sources and General Channels

Ryo NOMURA  Toshiyasu MATSUSHIMA  Shigeichi HIRASAWA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E92-A   No.11   pp.2936-2940
Publication Date: 2009/11/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E92.A.2936
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Information Theory
Keyword: 
joint source-channel coding,  separation theorem,  error probability,  

Full Text: PDF>>
Buy this Article




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.