Tag
huffman-coding
- Apr 5, 2025 Huffman Coding and the Greedy Merge How repeatedly merging the two lowest-weight nodes builds an optimal prefix code, what the sibling-property exchange shows, and where the code length bound comes from. algorithms
- Nov 5, 2024 Prefix Codes, the Kraft Inequality, and Why Huffman Is Optimal How decodability without separators constrains code lengths, what the Kraft sum measures, and the exchange argument that makes Huffman coding the best prefix code for a known distribution. computation theory