Abstract

A lossless adaptive compression algorithm for compressing first-order Markovian binary sources is presented. The method is a customised version of the recently introduced hierarchical enumerative coding. Experimental results indicate that it has good compression performance, especially when the transition probabilities are time-varying.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call