Parallel Computing
Links
Huffman Compression
Code
Data
TO DO
-
Build an array-based binary tree using each symbol's codeword.
-
Then, walk that tree (again and again) to decode the message.
-
-
Not counting any of the overhead bits, calculate the ratio of...
-
...decoded (i.e., ASCII) bits minus encoded bits, to decoded bits.
-
-
Calculate the theoretical (Shannon) minimum number of bits to
-
encode this message with any scheme. How close was Huffman?
-
-
minimum number of bits = SUM(frequency * -log2(probability))
-
-
...
-
-
turninDECODE
-
-
reportDECODE
-
a.zip
-
test.png
-
-
...
-
-
Now instead start with plain text and encode it using Huffman.
-
TreeNode
-
-
sqr.jpg
-
-
turninENCODE
-
-
Back to Parallel
6 Sept 2016