Content deleted Content added
rv. That's not quite the right way of putting it. I'll try to rephrase. |
Non-optimality |
||
Line 13:
:<math>\operatorname{P}(n) \ge \operatorname{P}(n+1) + \operatorname{P}(n+2)\, </math>
for <math>n=1,2,3,...</math>. Although it is the optimal symbol-by-symbol coding for such probability distributions, its optimality can, like that of [[Huffman coding]], be over-stated. [[Arithmetic coding]] has better compression capability for such distributions because it does not consider input symbols independently, but rather implicitly groups the inputs.
A modified unary encoding is used in [[UTF-8]]. Unary codes are also used in split-index schemes like the [[Golomb Rice code]]. Unary coding is [[Prefix-free code|prefix-free]], and can be uniquely decoded.
| |||