Variable-Length Encoding : In this method,each character is represented by a variable length binary codes.īoth the encoding techniques would definetly reduce the size of the file but Variable-Length encoding is better than Fixed-Length encoding.Let's understand this with an example.Suppose there is a file for which we have created a table representing the frequency of each character as follows:įixed-Length Encoding means assigning each character binary codes of fixed length.Since there are 6 characters so we need 3 bits to store each character uniquely.So,total bits required to store the whole file is 3.(45+11+6+16+100+50) = 684 bits.Fixed-Length Encoding : In this method,each character is represented by a fixed length binary codes.Using table an optimal way for representing each character as a binary string is being determined. For compression, a table representing the frequency of each character in a file is being built. For loseless compression, we rewrite the data of the original file in a more efficient way mostly in the form of binay string. Loseless Compression reduces a file's size with no loss of quality. Converting in the form of binary string would be beneficial because to store a binary 0 or 1 we need only one bit but to store a character we need 8 bits. we can convert each character in the file in the form of binary string. Basics of Encodingįirst of all, let us understand What is ' Encoding'?Įncoding means to convert the text in some other format.We generally perform encoding for reducing the size of the file.Suppose a text file is available then we can convert the text file in some other format which might be taking less space i.e. We will dive into Huffman Encoding directly now. Time and Space Complexity of Huffman Encoding.Implementation of Huffman Code using C++ STL.

Step by Step example of Huffman Encoding.We have present a step by step example of Huffman Encoding along with C++ implementation. It is one of the most successful Encoding Algorithms. We have explored Huffman Encoding which is a greedy algorithm that encodes a message into binary form efficiently in terms of space.

Encoding in reading examples