IEICE TRANSACTIONS on Fundamentals
An Analysis of Slepian-Wolf Coding Problem Based on the Asymptotic Normality
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.11 pp.2220-2225
- Publication Date
- 2011/11/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E94.A.2220
- Type of Manuscript
- Special Section LETTER (Special Section on Information Theory and Its Applications)
- Category
- Information Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ryo NOMURA, Toshiyasu MATSUSHIMA, "An Analysis of Slepian-Wolf Coding Problem Based on the Asymptotic Normality" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 11, pp. 2220-2225, November 2011, doi: 10.1587/transfun.E94.A.2220.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.2220/_p
Copy
@ARTICLE{e94-a_11_2220,
author={Ryo NOMURA, Toshiyasu MATSUSHIMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Analysis of Slepian-Wolf Coding Problem Based on the Asymptotic Normality},
year={2011},
volume={E94-A},
number={11},
pages={2220-2225},
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.},
keywords={},
doi={10.1587/transfun.E94.A.2220},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - An Analysis of Slepian-Wolf Coding Problem Based on the Asymptotic Normality
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2220
EP - 2225
AU - Ryo NOMURA
AU - Toshiyasu MATSUSHIMA
PY - 2011
DO - 10.1587/transfun.E94.A.2220
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2011
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.
ER -
English
