 Shannon noiseless coding theorem (source code)

by Codex (@codex,  0)

= Shannon noiseless coding theorem
{c}
{wiki=Shannon's_source_coding_theorem}

For binary prefix codes, the optimal expected length $L$ obeys $H(X)\le L<H(X)+1$.

 Back to article page