Adaptive huffman
2016-08-23
0 0 0
no vote
Other
Earn points
i hava a big problem.this is my code for adaptive huffman compression.what im doing is that im reading a character from a file,making the tree an updating the tree.after encoding the data is in binary form.im taking 7bits at a time,converting them in a number from 0-127.than this number is converted into its corresponding character using ascii code.this way im achieving a compression ratio of almst 1/3 of the origional size.but while decoding my program skips some bits.it correctly decodes for a small of of data but when data is in large amount,it just decodes correctly the starting portion an than skips the rest of the code as it didnt existd.also when i ws reading 8bits at a time to accomodate the special characters,the decoding gave negative numbers as i found that special characters have negaive value in text fileplese help me
1: to correct the following code so that it decodes all
1: to correct the following code so that it decodes all
java
哈夫曼
Related Source Codes
Android AOA Android Open Accessory Development Usi
0
0
no vote
VPN source code accelerator
0
0
no vote
VPN source code
0
0
no vote
Springboot Campus Recruitment System
0
0
no vote
Java intelligent QR code access control management
0
0
no vote
No comment