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

A binary source has p(1) = 0.99. Compute its entropy in bits per symbol, to 4 decimal places.