Content deleted Content added
More general optimality |
DavidCBryant (talk | contribs) Edited for style. |
||
Line 1:
'''Unary coding''' is an [[entropy encoding]] that represents a [[
Unary coding is easily shown to be an optimally efficient encoding for the following discrete [[probability distribution]]
Line 9:
:<math>P(n) = (k-1)k^{-n}\,</math>
for which
:<math>P(n) \ge P(n+1) + P(n+2)\, </math>
|