Huffman Coding minimizes the average number of coding digits per message. Minimizing the mean time by this method raises the problem of large variance. When the variance is large there is a greater probability that an arbitrary encoded message significantly exceeds the average. The delicate point here is the danger of an urgent message taking more time than expected, in addition to larger bandwidth or buffer requirements. With this research a large reduction of variance versus a small increase in mean time is examined for the purpose of modifiying Huffman Coding for a particular alphabet.

Approved for public release; distribution is unlimited.

http://archive.org/details/modificationofhu1094521449

Lieutenant (junior grade), Turkish Navy