- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | An Efficient Bayes Coding Algorithm using a New Unlimited Depth Context Tree (in Japanese) |
|---|---|
| Authors | Toshiyasu Matsushima 、Shigeichi Hirasawa |
| Released Year | 2008 |
| Format | Conference |
| Category | Source coding |
| Jounal Name | Proceedings of the 31th Symposium on Information Theory and its Applications |
| Jounal Page | vol.31, no.2, pp.809-814 |
| Published Year | 2008 |
| Published Month | 10 |
| Abstract （English） |
There are predictive and non-predictive algorithms in the Bayes codes. The CTW(Context TreeWeighting) algorithm has been interpreted as the non-predictive Bayes coding algorithm assuming a special prior distribution over context tree models. The two kinds of predictive Bayes coding algorithms using a fixed and an unlimited depth context tree were also proposed. The space complexity of the predictive Bayes coding algorithm using an unlimited depth context tree is O(t2) where t is the length of a source sequence. In this paper, we propose an efficient predictive Bayes coding algorithm using a new unlimited depth context tree whose space complexity is O(t). Moreover, the asymptotic code length of the Bayes coding algorithm using the unlimited depth context tree is investigated |
| Note （English） |
1 |
| Manuscript |
 Download
|
| Presentation |
Involved Papers
- An Efficient Bayes Coding Algorithm for the Source Based on Context Tree Models that Vary from Section to Section (in Japanese)
- Asymptotic property of universal lossless coding for independent piecewise identically distributed sources
- Bayes Universal Source Coding Scheme for Correlated Sources
- A study of interactive source coding of correlated sources (in Japanese)
- Asymptotic Property on Nonstationary Sources with Piecewise Constant Parameters (in Japanese)
- Asymptotic Property of Universal Lossless Coding for Independent Piecewise Identically Distributed Sources
