Abstract
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 language | English (US) |
|---|---|
| Pages (from-to) | 707-708 |
| Number of pages | 2 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 21 |
| Issue number | 6 |
| DOIs | |
| State | Published - Nov 1975 |
| Externally published | Yes |
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences