Abstract
Source coding theorem reveals the minimum achievable code length under the condition that the error probability is smaller than or equal to some small constant. In the single user communication system, the source coding theorem was proved for general sources. The class of general source is quite large and it is important result since the result can be applied for a wide class of sources. On the other hand there are several studies to evaluate the achievable code length more precisely for the restricted class of sources by using the restriction. In the multi-user communication system, although the source coding theorem was proved for general correlated sources, there is no study to evaluate the achievable code length more precisely. In this study, we consider the stationary memoryless correlated sources and show the coding theorem for Slepian-Wolf type problem more precisely than the previous result.
| Original language | English |
|---|---|
| Pages (from-to) | 2220-2225 |
| Number of pages | 6 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E94-A |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - 2011 Nov |
Fingerprint
Keywords
- Achievability
- Slepian-Wolf coding theorem
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Computer Graphics and Computer-Aided Design
- Applied Mathematics
- Signal Processing
Cite this
An analysis of slepian-wolf coding problem based on the asymptotic normality. / Nomura, Ryo; Matsushima, Toshiyasu.
In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E94-A, No. 11, 11.2011, p. 2220-2225.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - An analysis of slepian-wolf coding problem based on the asymptotic normality
AU - Nomura, Ryo
AU - Matsushima, Toshiyasu
PY - 2011/11
Y1 - 2011/11
N2 - Source coding theorem reveals the minimum achievable code length under the condition that the error probability is smaller than or equal to some small constant. In the single user communication system, the source coding theorem was proved for general sources. The class of general source is quite large and it is important result since the result can be applied for a wide class of sources. On the other hand there are several studies to evaluate the achievable code length more precisely for the restricted class of sources by using the restriction. In the multi-user communication system, although the source coding theorem was proved for general correlated sources, there is no study to evaluate the achievable code length more precisely. In this study, we consider the stationary memoryless correlated sources and show the coding theorem for Slepian-Wolf type problem more precisely than the previous result.
AB - Source coding theorem reveals the minimum achievable code length under the condition that the error probability is smaller than or equal to some small constant. In the single user communication system, the source coding theorem was proved for general sources. The class of general source is quite large and it is important result since the result can be applied for a wide class of sources. On the other hand there are several studies to evaluate the achievable code length more precisely for the restricted class of sources by using the restriction. In the multi-user communication system, although the source coding theorem was proved for general correlated sources, there is no study to evaluate the achievable code length more precisely. In this study, we consider the stationary memoryless correlated sources and show the coding theorem for Slepian-Wolf type problem more precisely than the previous result.
KW - Achievability
KW - Slepian-Wolf coding theorem
UR - http://www.scopus.com/inward/record.url?scp=80155136974&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80155136974&partnerID=8YFLogxK
U2 - 10.1587/transfun.E94.A.2220
DO - 10.1587/transfun.E94.A.2220
M3 - Article
AN - SCOPUS:80155136974
VL - E94-A
SP - 2220
EP - 2225
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 -