A Bayes coding algorithm using context tree

Toshiyasu Matsushima, Shigeichi Hirasawa

研究成果: Conference contribution

抄録

The context tree weighting (CTW) algorithm [Willems et al., 1993] has high compressibility for universal coding with respect to FSMX sources. The present authors propose an algorithm by reinterpreting the CTW algorithm from the viewpoint of Bayes coding. This algorithm can be applied to a wide class of prior distribution for finite alphabet FSMX sources. The algorithm is regarded as both a generalized version of the CTW procedure and a practical algorithm using a context tree of the adaptive Bayes coding which has been studied in Mataushima et al. (1991). Moreover, the proposed algorithm is free from underflow which frequently occurs in the CTW procedure.

本文言語English
ホスト出版物のタイトルProceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
ページ数1
DOI
出版ステータスPublished - 1994 12月 1
イベント1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway
継続期間: 1994 6月 271994 7月 1

出版物シリーズ

名前IEEE International Symposium on Information Theory - Proceedings
ISSN(印刷版)2157-8095

Conference

Conference1994 IEEE International Symposium on Information Theory, ISIT 1994
国/地域Norway
CityTrondheim
Period94/6/2794/7/1

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 情報システム
  • モデリングとシミュレーション
  • 応用数学

フィンガープリント

「A Bayes coding algorithm using context tree」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル