| タイトル | Evaluation of the Minimum Overflow Threshold of Bayes Codes for a Markov Source |
|---|---|
| 著者 | 齋藤 翔太 、宮 希望 、松嶋 敏泰 |
| 年度 | 2014 |
| 形式 | 国際学会 |
| 分野 | 情報源符号化 |
| 掲載雑誌名 | Proceedings of the 2014 International Symposium on Information Theory and Its Applications |
| 掲載号・ページ | pp.211–215 |
| 掲載年 | 2014 |
| 掲載月 | 10 |
| アブスト （日本語） |
2014 International Symposium on Information Theory and its Applications (ISITA2014) 2014年10月26–29日（発表日: 27日） Melbourne, Australia 査読有 DOI: なし |
| アブスト （英語） |
The objective of this research is to evaluate the $\epsilon $-minimum overflow threshold of the Bayes codes for a Markov source. In the lossless variable-length source coding problem, typical criteria are the mean codeword length and the overflow probability. The overflow probability is the probability with which a codeword length per source symbol exceeds a threshold and the $\epsilon $-minimum overflow threshold is defined. In the non-universal setting, the Shannon code is optimal under the mean codeword length and the $\epsilon $-minimum overflow threshold for the Shannon code is derived for an i.i.d. source. On the other hand, in the universal setting, the Bayes code is one of universal codes which minimize the mean codeword length under the Bayes criterion. However, few studies have been done on the overflow probability for the Bayes codes. In this paper, we assume a stationary ergodic finite order Markov source and derive the upper and lower bounds of the $\epsilon$-minimum overflow threshold of the Bayes codes. |
| 備考 （日本語） |
1 |
| 備考 （英語） |
1 |
| 論文原稿 | |
| 発表資料 |
