An upper bound on the entropy of run-length coding (Corresp.)
暂无分享,去创建一个
An upper bound on the entropy per run in binary run-length coding is a \loga - (a - 1)\log (a - 1) , where a is the average run length. This upper bound is attained by a time-quantized Poisson square wave.
[1] Jack Capon,et al. A probabilistic model for run-length coding of pictures , 1959, IRE Trans. Inf. Theory.