Ziv-Lempel incremental parsing [1] is a fundamental algorithm for lossless data compression. There is a simple enumerative implementation [7] which preserves a duality between the encoder and the decoder. However, due to its compactness, the implementation when combined with a complete integer code, allows only an input sequence with a length consistent with the parsing boundaries. In this letter, we propose a simple additional mechanism for post-processing a binary file of arbitrary length, provided the file punctuation is externally managed.

Many Ziv-Lempel algorithms have a similar property, that is, slow encoding and fast decoding. This paper proposes a simple improved Ziv-Lempel algorithm to encode a large amount of data quickly as well as compactly by using multiple-processor system.