## Abstract

This paper considers universal lossless variable-length source coding problem and deals with one of the fundamental limits and pointwise asymptotics of the Bayes code for stationary ergodic finite order Markov sources. As investigation of the fundamental limits, we show upper and lower bounds of the minimum rate such that the probability which exceeds it is less than ϵ ϵ (0, 1). Furthermore, we prove that the codeword length ovf the Bayes code satisfies the asymptotic normality (pointwise equation asymptotics) and the law of the iterated logarithm (pointwise equation asymptotics), where n represents length of a source sequence and 'log' is the natural logarithm.

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

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

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 1986-1990 |

Number of pages | 5 |

Volume | 2015-June |

ISBN (Print) | 9781467377041 |

DOIs | |

Publication status | Published - 2015 Sept 28 |

Event | IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong Duration: 2015 Jun 14 → 2015 Jun 19 |

### Other

Other | IEEE International Symposium on Information Theory, ISIT 2015 |
---|---|

Country/Territory | Hong Kong |

City | Hong Kong |

Period | 15/6/14 → 15/6/19 |

## ASJC Scopus subject areas

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