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

Ryo Nomura, Toshiyasu Matsushima, Shigeichi Hirasawa

研究成果: Article

抜粋

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.

元の言語English
ページ(範囲)2936-2940
ページ数5
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E92-A
発行部数11
DOI
出版物ステータスPublished - 2009 11

ASJC Scopus subject areas

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

フィンガープリント On the condition of ∈-transmissible joint source-channel coding for general sources and general channels' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用