Variable-to-fixed length codes and the conservation of entropy

Serap A. Savari · IEEE Transactions on Information Theory · 1999

For a large class of parsing rules, we introduce a "conservation of entropy" theorem for the output of a unifilar Markov source. Using this theorem and renewal theory, we find a procedure to generate asymptotically optimal generalized variable-to-fixed length codes.

Read the paper · More papers on PaperTik