For LZ algorithms, the dictionary made when compressing the first version would be reused for subsequent &quot;versions&quot; of the same document. So sort of a static dictionary, but specialized for what you&#x27;re sending.<p>That or maybe he means the Huffman codes, in which case you&#x27;d do the same thing but s&#x2F;LZ&#x2F;Huffman&#x2F; s&#x2F;dictionary&#x2F;tree&#x2F;g.<p>I tend to favor algorithms like LZF and LZ4 that don&#x27;t have a separate dictionary for compressing text though, since there&#x27;s just about no performance loss on either end and compression is &quot;good enough&quot;.