CalcPath
Subjects
Dashboard
Diagnostic
Feedback
Search...
Source Coding and the Entropy Bound
Shannon's source coding theorem in both directions, and Kraft's inequality — why entropy is the floor no lossless code can beat.
0/66 mastered
1 / 66
A memoryless source emits a, b, c, d with probabilities 0.5, 0.25, 0.125, 0.125. Compute its entropy in bits per symbol.
Review the explanation for this topic →
Your answer
Draw
Hint
Type your answer — press Enter to check
Enter your answer
d
c
( )
x
n
√
⌫
AC
7
8
9
+
4
5
6
−
1
2
3
×
0
.
a
b
Check
↵
÷
#11811
All topics
All Information Theory topics