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.
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences