Evaluation of the minimum overflow threshold of bayes codes for a Markov source

Shota Saito, Nozomi Miya, Toshiyasu Matsushima

研究成果: Conference contribution

5 被引用数 (Scopus)

抄録

The objective of this research is to evaluate the ε-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 ε-minimum overflow threshold is defined. In the non-universal setting, the Shannon code is optimal under the mean codeword length and the ε-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 ε-minimum overflow threshold of the Bayes codes.

本文言語English
ホスト出版物のタイトルProceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014
出版社Institute of Electrical and Electronics Engineers Inc.
ページ211-215
ページ数5
ISBN(電子版)9784885522925
出版ステータスPublished - 2014 12 8
イベント2014 International Symposium on Information Theory and Its Applications, ISITA 2014 - Melbourne, Australia
継続期間: 2014 10 262014 10 29

出版物シリーズ

名前Proceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014

Conference

Conference2014 International Symposium on Information Theory and Its Applications, ISITA 2014
CountryAustralia
CityMelbourne
Period14/10/2614/10/29

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

引用スタイル