FIX to Compressed Full-Text Indexes
In page 124, we say that Huffman assigns a code of length
floor(log(1/p)) or ceil(log(1/p)) to a symbol with probability p. This
is shamefully wrong. But we use this only to argue about the sum over
all the symbols, and in this case the result stays true.