How does this help compression

gzip searches the hash chains so that the most recent strings are found first, and matches of length 3 which are too distant (more than 4K bytes) are ignored. How does this help compression? (Hint: Consider the back-end Huffman processing.)

Leave a Reply

Your email address will not be published. Required fields are marked *