Generalization of Huffman coding to minimize the probability of buffer overflow (Corresp.)
P.A. Humblet · IEEE Transactions on Information Theory · 1981
An algorithm is given to find a prefix condition code that minimizes the value of the moment generating function of the codeword length distribution for a given positive argument. This algorithm is used in an iterative way to yield a code that maximizes the rate of decay of the probability of buffer overflow as the buffer length increases.