Modification of Huffman Coding.

Thumbnail Image
Files
modificationofhu00kili.pdf (3.78 MB)
Authors
Kilic, Suha
Subjects
Huffman coding
reduction of variance
increase in mean time
Advisors
Hamming, Richard W.
Date of Issue
1985-03
Date
March 1985
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
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.
Type
Thesis
Description
URI
https://hdl.handle.net/10945/21449
Series/Report No
Department
Administrative Sciences
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
Copyright is reserved by the copyright owner
Collections
Theses