On the variance and the probability of length overflow of lossless codes

Ryo Nomura, Toshiyasu Matsushima, Shigeichi Hirasawa

Research output: Contribution to journalArticle

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 languageEnglish
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
DOIs
Publication statusPublished - 2000 Jan 1

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'On the variance and the probability of length overflow of lossless codes'. Together they form a unique fingerprint.

  • Cite this