Proof of Theorem 3.7 The Huffman tree is optimal.
Published in Papers/Documentation, Huffman Coding
A nice tidy proof that the Huffman tree is an optimal prefix code for a given message. Note that a library reader finds that there is an error in the fixed-length codes listed in Table 1, a and b have duplicate values.
http://maths.abdn.ac.uk/~igc/tch/mx4002/notes/node59.html
* * *
Posted in December 16th, 1999
No User Commented In " Proof of Theorem 3.7 The Huffman tree is optimal. "
Subscribes to this post Comment RSS or TrackBack URL
