 This means that instead of storing the structure of the code tree for decompression only the lengths of the codes are required, reducing the size of the encoded data.Additionally, because the codes are sequential, the decoding algorithm can be dramatically simplified so that it is computationally efficient.The normal Huffman coding algorithm assigns a variable length code to every symbol in the alphabet.