| タイトル | 補助情報を伴う情報源符号化定理に関する一考察 |
|---|---|
| 著者 | 野村亮 、松嶋敏泰 |
| 年度 | 2009 |
| 形式 | 国内学会 |
| 分野 | 情報源符号化 |
| 掲載雑誌名 | 電子情報通信学会技術報告 |
| 掲載号・ページ | pp.31-36 |
| 掲載年 | 2009 |
| 掲載月 | 9 |
| アブスト （日本語） |
学会名：情報理論研究会 日程：不明 場所：不明 |
| アブスト （英語） |
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. |
| 備考 （日本語） |
1 |
| 備考 （英語） |
1 |
| 論文原稿 | |
| 発表資料 |
