Huffman Coding based upon a symbol vector with known propability
[QM,L,avglen,entr,eff]=huffmandict(SB,h)
a vector, representing symbols
a probability vector containing the probability of each entry in SB. Must have the same length as SB
the complete code table as string vector. The symbol, the bit sequence and the number of bits are contained.
number of bits used for coding the corresponding symbol
Average Length based on rel. propabilities and the Sybmol length
Entropy of H
Efficiency of the Huffman Coding
This function creates the coding tree based upon a given histogram.