Nonaic Huffman Coding
Public  07/26/16  8xp  Programming  40.0% 
Huffman Coding is a lossless data compression method that is based on the entropy of bit patterns in the data.
Usually for strings, conventional 8bit (0255) hashing is used for frequencies preceding actual coding. So, these 8bit chunks directly correspond to wellknow characters (such as a,b,c,etc. More specifically ASCII encoding) So, for this problem assume ASCII encoding for characters.
This problem asks to use Huffman coding scheme on this text file, but using 9bit chunks for frequencies and then actual coding. Also, for this problem you do not need to account for additional information to ensure decompression.
File is currently 68337 bytes. Submit the compressed file size below in bytes. (where file does not include any information for decompression)
Usually for strings, conventional 8bit (0255) hashing is used for frequencies preceding actual coding. So, these 8bit chunks directly correspond to wellknow characters (such as a,b,c,etc. More specifically ASCII encoding) So, for this problem assume ASCII encoding for characters.
This problem asks to use Huffman coding scheme on this text file, but using 9bit chunks for frequencies and then actual coding. Also, for this problem you do not need to account for additional information to ensure decompression.
File is currently 68337 bytes. Submit the compressed file size below in bytes. (where file does not include any information for decompression)
New Members
 gunnez97 2d:19h
 CcGaviria 3w
 wuyingddg 3w
 curiosity_def 3w:1d
 skywalkert 3w:2d
Fresh Problems

Best Matrices Multiplication 2 2d:21h
solved by 7 
Central binomial coefficients 3d:20h
solved by 10 
Harmonic variations 6d:12h
solved by 7 
Special squarefree sum 1w:3d
solved by 5 
A Staggering Sequence 1w:6d
solved by 11