An Upper Bound on the Entropy of Run-Length Coding

Thomas S. Huang

Research output: Contribution to journalArticlepeer-review


An upper bound on the entropy per run in binary run-length coding is a log a − (a − 1) log (a − 1), where a is the average run length. This upper bound is attained by a time-quantized Poisson square wave.

Original languageEnglish (US)
Pages (from-to)675-676
Number of pages2
JournalIEEE Transactions on Information Theory
Issue number5
StatePublished - Sep 1974
Externally publishedYes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'An Upper Bound on the Entropy of Run-Length Coding'. Together they form a unique fingerprint.

Cite this