- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | A Note on the Fixed-Length Source Coding Theorems for Sources with Side Information (in Japanese) |
|---|---|
| Authors | Ryo NOMURA 、Toshiyasu MATSUSHIMA |
| Released Year | 2009 |
| Format | Conference |
| Category | Source coding |
| Jounal Name | IEICE technical report |
| Jounal Page | pp.31-36 |
| Published Year | 2009 |
| Published Month | 9 |
| Abstract （English） |
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 is a study 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 precisly. In this study, we consider the problem that there exists a side information. This setting is one kind of correlated sources and show the coding theorem more precisely than the previous result. |
| Note （English） |
1 |
| Manuscript | |
| Presentation |
Involved Papers
- Hierarchical Multi-label Classification on Statistical Decision Theory (in Japanese)
- A Consideration on Minimum Storage Regenerating Codes for Functions (in Japanese)
- A Note on the Inference Algorithm on the Factor Graph based on the Linear Programming (in Japanese)
- An Efficient Algorithm for the Bayes Codes using an Unlimited Depth Context Tree
- Linear Programming Decoding of Binary Linear Codes for Multiple-Access Channel (in Japanese)
