Abstract
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 language | English (US) |
|---|---|
| Pages (from-to) | 675-676 |
| Number of pages | 2 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 20 |
| Issue number | 5 |
| DOIs | |
| State | Published - Sep 1974 |
| Externally published | Yes |
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences