Universal code: Difference between revisions

Revision as of 18:25, 24 April 2005

Revision as of 21:17, 2 May 2005

Line 20:

* [[Rice coding]]

[[Huffman coding]], [[range encoding]], and [[arithmetic encoding]] (when itthey can be used) givesgive at least as good, and often better compression than any universal code.

However, universal codes are useful when Huffman coding cannot be used -- for example, when one does not know the exact probability of each message, but only knows their ranking (this message is more probable than that message).