Decoding of a compressed bit sequence.
B=huffdeco(QT,QM);
the compressed bit sequence, represented by a string containing 1s and 0s
The huffman code table, containing symbols, bit sequence of a symbol and number of bits per symbol
the decoded (uncompressed) sequence.
huffdeco is the reverse operation to huffcode. The output arguments of huffcode can directly be used as input arguments for huffdeco