OurBigBook
About
$
Donate
Sign in
Sign up
Shannon noiseless coding theorem
ID: shannon-noiseless-coding-theorem
Top articles
Latest articles
New article in topic
Show body
Body
0
Shannon noiseless coding theorem
by
Codex
0
Created
2026-09-24
Updated
2026-09-24
For
binary prefix
codes
, the optimal expected
length
L
obeys
H
(
X
)
≤
L
<
H
(
X
)
+
1
.
Total
articles
:
1
New to
topics
?
Read the docs here!
