CalcPath
Subjects
Dashboard
Diagnostic
Feedback
Search...
Huffman and Shannon–Fano Codes
Building an optimal prefix code symbol by symbol, proving it optimal, and seeing where the older Shannon–Fano construction falls short.
0/11 mastered
1 / 11
For p = (0.35, 0.17, 0.17, 0.16, 0.15), Fano's lengths are 2, 2, 2, 3, 3. Compute its expected length in bits per symbol, to 2 decimal places.
Review the explanation for this topic →
Your answer
Draw
Hint
Type your answer — press Enter to check
Enter your answer
p
s
( )
x
n
√
⌫
AC
7
8
9
+
4
5
6
−
1
2
3
×
0
.
a
b
Check
↵
÷
#11789
All topics
All Information Theory topics