In this project you
will implement Huffman encoding and decoding.
Your system must accept a file and you need to form a binary (Huffman) tree for the same.
During the construction of Huffman tree, use the priority queue to select nodes with smallest
frequencies. Once you have constructed the tree, traverse the tree and create a dictionary of
codewords (letter to code). Given any new sentences, your system must show how the sentence
is converted to Huffman code and then decoded back to original sentence.
Note that you must implement BST and Heap yourself and must not rely on any language
libraries. You can use external libraries like GraphViz to display your Huffman tree.
AND I WANT A SIMPLE GUI
Hello, I am an expert in Huffman algorithm. I have implemented it for test zip/unzip file. I can finish your task in 2-3 hours with good UI. Please contact me . Kind Regards.
6 freelancers are bidding on average $115 for this job
Hello, I have vast experience of java programming and also data communication. I can implement huffman coding for you within a day. Let me know if you're interested.