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 source has H = 2.3 bits/symbol and a block code of rate R = 2.4 is used. The achievability proof takes eps = (R - H)/2. Give eps.