Bounds on the Bit Rate of Linear Runlength Codes

Thomas S. Huang

Research output: Contribution to journalArticlepeer-review


We define a class of easily implementable suboptimum codes for runlengths of binary facsimile images which we call linear runlength codes because the number of bits we transmit for each run is approximately proportional to its length. Then, assuming the runlengths are geometrically distributed, we derive bounds on the minimum bit rate achievable by linear runlength codes of a given size.

Original languageEnglish (US)
Pages (from-to)707-708
Number of pages2
JournalIEEE Transactions on Information Theory
Issue number6
StatePublished - Nov 1975
Externally publishedYes

ASJC Scopus subject areas

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


Dive into the research topics of 'Bounds on the Bit Rate of Linear Runlength Codes'. Together they form a unique fingerprint.

Cite this