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

For p = 0.125, compute the Shannon length ceil(log2(1/p)) in bits.