2 articles
Why frequent symbols deserve shorter codes, how Huffman coding builds them, and the counting argument proving no lossless scheme can shrink every possible file.
Shannon entropy counts the yes/no questions you need to pin down an unknown. That count turns out to be the exact limit of lossless compression, and the reason error correction has a price.