The context tree weighting (CTW) algorithm has high compressibility for the universal coding with respect to FSMX sources. In this paper, we propose an algorithm by reinterpreting the CTW algorithm from the viewpoint of Bayes coding. Our 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 previously studied. Moreover, the proposed algorithm is free from underflow which frequently occurs in the CTW procedure.
|出版ステータス||Published - 1994 12月 1|
|イベント||Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw|
継続期間: 1994 6月 27 → 1994 7月 1
|Other||Proceedings of the 1994 IEEE International Symposium on Information Theory|
|Period||94/6/27 → 94/7/1|
ASJC Scopus subject areas