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
In which year did Huffman publish the optimal prefix-code algorithm?
Review the explanation for this topic →
Your answer
Draw
Hint
Type your answer — press Enter to check
Enter your answer
( )
x
n
√
⌫
AC
7
8
9
+
4
5
6
−
1
2
3
×
0
.
a
b
Check
↵
÷
#11794
All topics
All Information Theory topics