On the Redundancy Achieved by Huffman Codes
Name
MIT-LCS-TM-536.pdf
Size
1.65 MB
Format
Adobe PDF
Checksum (MD5)
1a021561359e855c8216829ddf436026
Author(s)
De Prisco, Roberto
De Santis, Alfredo
Date Issued
September 1995
Series/Report no.
MIT-LCS-TM-536
Abstract
It has been recently proved that the redundancy r of any discrete memoryless source satisfies r < 1 -H(pn), where pn is the least likely source letter probability. This bound is achieved only by sources consisting of two letters. We prove a sharper bound if the number of source letters is greater than two. Also provided is a new upper bound on r, as function of the two least likely source letter probabilities which improve on previous results.
Persistent DSpace Link
