Modification of Huffman Coding.
Hamming, Richard W.
Dolk, Daniel R.
MetadataShow full item record
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
Showing items related by title, author, creator and subject.
Akinsel, Serdar (1985-12);A method of coding an ensemble of messages of a finite number of symbols is developed. Minimizing the average number of coding digits per message by using Huffman coding can result in a large variance. This is a problem ...
Performance of coherent and noncoherent RAKE receivers with convolutional coding ricean fading and pulse-noise interference Kowalske, Kyle E. (Monterey, California. Naval Postgraduate School, 2004-06);The performance of coherent and noncoherent RAKE receivers over a fading channel in the presence of pulse-noise interference and additive white Gaussian noise is analyzed. Coherent RAKE receivers require a pilot tone for ...
Reduction in bandwidth and buffer size by using modified Huffman coding after dropping the less frequent source symbols Corapcioglu, Ahmet (1987-03);This research employs the modified Huffman coding technique after dropping the selected source symbols, with respect to the usage frequencies. The expected results are a decrease in average length as well as in variance. ...