An upper bound on run-length coding entropy
Iickho Song, Souguil Ann · Proceedings of the IEEE · 1985
A method of calculating the maximum entropy per run in binary run-length coding is given when run length is limited to a maximum of M. It is also shown that Huang's bound [1] can be obtained from the present result as M tends to infinity.