We describe an efficient algorithm for decoding canonical Huffman codes with look-up tables. Furthermore, a connection between the probability of a symbol and the length of its codeword in a Huffman code is investigated. We design a method for estimating probabilities of codewords in a given Huffman code. We show how this method can be used to estimate a ``good'' size for the look-up table used in the decoding.