### Abstract

The optimal universal code for FSMX sources (Rissanen, 1981) with respect to Bayes redundancy criterion (Davison, 1973) is deduced under the condition that the model, the probabilistic parameters, and the initial state are unknown. The algorithm is not only Bayes optimal for FSMX sources but also asymptotically optimal for a stationary ergodic sources. Further, the algorithm is regarded as a generalization of the Ziv-Lempel algorithm. In the basic CTW algorithm, the algorithm needs an initial context, where a finite constant is the depth of the context tree, for calculating the coding probability. For the problems of the initial situation and the infinite depth tree, the extensions to the CTW algorithm have been proposed in a paper by Willems (1994). In this paper, an optimal algorithm is proposed that gives solution against these problems from new point of view. This proposed method is also regarded as a generalization of the Ziv-Lempel algorithm.

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

Title of host publication | IEEE International Symposium on Information Theory - Proceedings |

Place of Publication | Piscataway, NJ, United States |

Publisher | IEEE |

Pages | 388 |

Number of pages | 1 |

Publication status | Published - 1995 |

Event | Proceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can Duration: 1995 Sep 17 → 1995 Sep 22 |

### Other

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

City | Whistler, BC, Can |

Period | 95/9/17 → 95/9/22 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Applied Mathematics
- Modelling and Simulation
- Theoretical Computer Science
- Information Systems

### Cite this

*IEEE International Symposium on Information Theory - Proceedings*(pp. 388). Piscataway, NJ, United States: IEEE.

**Bayes coding algorithm for FSM sources.** / Matsushima, Toshiyasu; Hirasawa, Shigeichi.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IEEE International Symposium on Information Theory - Proceedings.*IEEE, Piscataway, NJ, United States, pp. 388, Proceedings of the 1995 IEEE International Symposium on Information Theory, Whistler, BC, Can, 95/9/17.

}

TY - GEN

T1 - Bayes coding algorithm for FSM sources

AU - Matsushima, Toshiyasu

AU - Hirasawa, Shigeichi

PY - 1995

Y1 - 1995

N2 - The optimal universal code for FSMX sources (Rissanen, 1981) with respect to Bayes redundancy criterion (Davison, 1973) is deduced under the condition that the model, the probabilistic parameters, and the initial state are unknown. The algorithm is not only Bayes optimal for FSMX sources but also asymptotically optimal for a stationary ergodic sources. Further, the algorithm is regarded as a generalization of the Ziv-Lempel algorithm. In the basic CTW algorithm, the algorithm needs an initial context, where a finite constant is the depth of the context tree, for calculating the coding probability. For the problems of the initial situation and the infinite depth tree, the extensions to the CTW algorithm have been proposed in a paper by Willems (1994). In this paper, an optimal algorithm is proposed that gives solution against these problems from new point of view. This proposed method is also regarded as a generalization of the Ziv-Lempel algorithm.

AB - The optimal universal code for FSMX sources (Rissanen, 1981) with respect to Bayes redundancy criterion (Davison, 1973) is deduced under the condition that the model, the probabilistic parameters, and the initial state are unknown. The algorithm is not only Bayes optimal for FSMX sources but also asymptotically optimal for a stationary ergodic sources. Further, the algorithm is regarded as a generalization of the Ziv-Lempel algorithm. In the basic CTW algorithm, the algorithm needs an initial context, where a finite constant is the depth of the context tree, for calculating the coding probability. For the problems of the initial situation and the infinite depth tree, the extensions to the CTW algorithm have been proposed in a paper by Willems (1994). In this paper, an optimal algorithm is proposed that gives solution against these problems from new point of view. This proposed method is also regarded as a generalization of the Ziv-Lempel algorithm.

UR - http://www.scopus.com/inward/record.url?scp=0029206778&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029206778&partnerID=8YFLogxK

M3 - Conference contribution

SP - 388

BT - IEEE International Symposium on Information Theory - Proceedings

PB - IEEE

CY - Piscataway, NJ, United States

ER -