### Abstract

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.

Original language | English |
---|---|

Publication status | Published - 1994 Dec 1 |

Event | Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: 1994 Jun 27 → 1994 Jul 1 |

### Other

Other | Proceedings of the 1994 IEEE International Symposium on Information Theory |
---|---|

City | Trodheim, Norw |

Period | 94/6/27 → 94/7/1 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Bayes coding algorithm using context tree'. Together they form a unique fingerprint.

## Cite this

Matsushima, T., & Hirasawa, S. (1994).

*Bayes coding algorithm using context tree*. Paper presented at Proceedings of the 1994 IEEE International Symposium on Information Theory, Trodheim, Norw, .