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/11 mastered

1 / 11

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.