The Huffman algorithm is an encoding (not compression) algorithm, that takes effect at the end of the compression process, by creating variable-length codes over a large number of bits. The codes have the advantage of a unique prefix, but they may be correctly decoded despite their variable length, and this can be done quickly with the use of tables. Lire la suite