Bounds to the length of the shortest codeword in a binary Huffman code are obtained. Among them are bounds assuming knowledge of different subsets of the probability distribution. Each is shown to be the tightest possible bound for the subset of probabilities it presumes. Two lower bounds to the redundancy of the Huffman code are also obtained. They are also shown to be the tightest possible bounds.
展开▼
