Thumbnail
Access Restriction
Subscribed

Author Stubley, P.R.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1994
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Equations ♦ Costs ♦ Business
Abstract There has been much interest in recent years in bounds on the redundancy of Huffman codes, given only partial information about the source word distribution, such as the probability of the most likely source. This work determines upper and lower bounds for the redundancy of Huffman codes of source words which are binomially distributed. Since the complete distribution is known, it is possible to determine bounds which are much tighter than other bounds in the literature, given only p, the probability of the most likely symbol of the binary source, and K, where there are 2/sup K/ source words. The upper and lower bounds will be shown to converge to the same value as K becomes large, resulting in a simple approximation which can be used to predict the redundancy of the Huffman code, given p and K, without constructing the code.<<ETX>>
Description Author affiliation: Bell-Northern Res., Montreal, Que., Canada (Stubley, P.R.)
ISBN 0818656379
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1994-03-29
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 349.92 kB
Page Count 8
Starting Page 90
Ending Page 97


Source: IEEE Xplore Digital Library