On the condition of ∈-transmissible joint source-channel coding for general sources and general channels

Ryo Nomura, Toshiyasu Matsushima, Shigeichi Hirasawa

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)2936-2940
Number of pages5
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number11
Publication statusPublished - 2009 Nov


  • Error probability
  • Joint source-channel coding
  • Separation theorem

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'On the condition of ∈-transmissible joint source-channel coding for general sources and general channels'. Together they form a unique fingerprint.

Cite this