Codex Wiki
OurBigBook.com
Site
Source code
Shannon noiseless coding theorem
Home
Mathematics
Area of mathematics
Probability and statistics
Information theory
OurBigBook.com
Words: 13
For binary prefix codes, the optimal expected length
L
obeys
H
(
X
)
≤
L
<
H
(
X
)
+
1
.
Ancestors
(5)
Information theory
Probability and statistics
Area of mathematics
Mathematics
Home
Incoming links
(3)
Solution
Solution
Solution