In profoundly influential works, Shannon and Huffman show that if
Alice wants to send a message \(X\) to Bob, it's sufficient for her
to send roughly \(H(X)\) bits (in expectation), where \(H\) denotes
Shannon's entropy function. In other words, the...
Read More