huffman-code

I want to compress many 32bit number using huffman compression. Each number may appear multiple times, and I know that every number will be replaced with some bit sequences: 111 010 110 1010 1000 etc... Now, the question: How many different numbers can be added to the huffman tree before the length of the binary sequence exceeds 32bits? The rule of generating sequences (for those who don't know) is that every time a new number is added you must assign it the smallest binary sequence possible that is not the prefix of another. You seem to understand the principle of prefix codes. Many people

What is the best compression algorithm that allows random reads/writes in a file? I know that any adaptive compression algorithms would be out of the question. And I know huffman encoding would be out of the question. Does anyone have a better compression algorithm that would allow random reads/writes? I think you could use any compression algorithm if you write it in blocks, but ideally I would not like to have to decompress a whole block at a time. But if you have suggestions on an easy way to do this and how to know the block boundaries, please let me know. If this is part of your solution,

I am writing a Huffman encoding/decoding tool and am looking for an efficient way to store the Huffman tree that is created to store inside of the output file. Currently there are two different versions I am implementing. This one reads the entire file into memory character by character and builds a frequency table for the whole document. This would only require outputting the tree once, and thus efficiency is not that big of a concern, other than if the input file is small. The other method I am using is to read a chunk of data, about 64 kilobyte in size and run the frequency analysis over