SHARING INITIAL DICTIONARIES AND HUFFMAN TREES BETWEEN MULTIPLE COMPRESSED BLOCKS IN LZ BASED COMPRESSION ALGORITHMS

摘要

A string of data is partitioned into a set of blocks. Each block is compressed based on a set of initial dictionaries and a set of Huffman trees. Each block is associated by a pointer with an initial dictionary in the set of initial dictionaries and a Huffman tree in the set of Huffman trees used to compress that block. A compressed string of data includes the set of initial dictionaries the set of Huffman trees and the compressed blocks and associated pointers.