Skip to content
vintesh edited this page Apr 25, 2013 · 3 revisions

The project includes the implementation of

  • Huffman Code Generation
    • Using simple Symbols-Probability Map
    • For Given File with different symbols
  • File Compression/Encoding (with very significant Compression Ratio)
  • File Decompressing/Decoding

No Tree like DS is used. Only simple DS like Queue, ArrayList, Map etc. is used. No Recursion is used, all the methods are the iterative only.

This is the Netbeans Project which you can directly download & use.

*[It also include the packages from https://github.com/nayuki/Huffman-Coding for reference understanding.]

Clone this wiki locally