### Abstract

The probability of length overflow is redefined. The resulting probability minimizes the expected codelength. The moment of self-information and the moment of codelength are introduced as these play very important role to analyze the probability of length overflow.

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

Number of pages | 1 |

Journal | IEEE International Symposium on Information Theory - Proceedings |

DOIs | |

Publication status | Published - 2000 Jan 1 |

### Fingerprint

### ASJC Scopus subject areas

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