Skip to content

Latest commit

 

History

History
9 lines (6 loc) · 669 Bytes

README.md

File metadata and controls

9 lines (6 loc) · 669 Bytes

Huffman-coding

This implementation of Huffman code that is a particular type of optimal prefix code which is commonly used for lossless data compression

A Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. The process of finding or using such a code proceeds by means of Huffman coding

The steps i followed:

  a)Encoding:The steps I followed were Making Frequency Dictionary,Constructing Heap, Constructing Binary Tree,Building Codes ,Encoding Text,Padding Encoding Text Convert,and coverting them into bytes then comperessing file
  b)Decoding: Decompressing Text ,Remove Padding, Decoding Text.