| Current Forum: Homework 4 - Huffman Trees (Part 1) |
| Date: Sat Oct 6 2001 1:21 pm |
| Author: Agarwal, Aditya <adityaa@andrew.cmu.edu> |
| Subject: Re: Best way to store the code table |
|
|
Thats not entirely accurate. The maximun length of a prefix code in huffman is
= ceiling(log_2(number of characters))
= ceiling(log_2(256))
= 8
So, no prefix codes will be longer than 8 bits.
|
|