### 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.

Original language | English |
---|---|

Pages (from-to) | 2936-2940 |

Number of pages | 5 |

Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |

Volume | E92-A |

Issue number | 11 |

DOIs | |

Publication status | Published - 2009 Nov |

### Fingerprint

### Keywords

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

### ASJC Scopus subject areas

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

### Cite this

*IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences*,

*E92-A*(11), 2936-2940. https://doi.org/10.1587/transfun.E92.A.2936

**On the condition of ∈-transmissible joint source-channel coding for general sources and general channels.** / Nomura, Ryo; Matsushima, Toshiyasu; Hirasawa, Shigeichi.

Research output: Contribution to journal › Article

*IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences*, vol. E92-A, no. 11, pp. 2936-2940. https://doi.org/10.1587/transfun.E92.A.2936

}

TY - JOUR

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

AU - Nomura, Ryo

AU - Matsushima, Toshiyasu

AU - Hirasawa, Shigeichi

PY - 2009/11

Y1 - 2009/11

N2 - 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.

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.

KW - Error probability

KW - Joint source-channel coding

KW - Separation theorem

UR - http://www.scopus.com/inward/record.url?scp=84883887958&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883887958&partnerID=8YFLogxK

U2 - 10.1587/transfun.E92.A.2936

DO - 10.1587/transfun.E92.A.2936

M3 - Article

AN - SCOPUS:84883887958

VL - E92-A

SP - 2936

EP - 2940

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 11

ER -