An upper bound on the entropy of run-length coding (Corresp.)
T.S. Huang · IEEE Transactions on Information Theory · 1974
An upper bound on the entropy per run in binary run-length coding isa \loga - (a - 1)\log (a - 1), whereais the average run length. This upper bound is attained by a time-quantized Poisson square wave.