-
Recent Posts
Recent Comments
Archives
Categories
Meta
Tag Archives: huffman
Never waste your memory! (Huffman Encoding)
In Morse code, a simple “dit” (.) represents the letter e, while a more complex sequence “dah-dit-dah-dah” (-.–) represents the letter y. As you probably know, the occurrence of e is significantly higher than the occurrence of y in most … Continue reading
Posted in Bit-Twiddling, Information Theory, Uncategorized
Tagged binary tree, compression, data, entropy, huffman, information
Comments Off on Never waste your memory! (Huffman Encoding)