In the implementation of lossless compression, the traditional Lempel-Ziv dictionary algorithm produces good compression performance, but at a relatively slow processing speed for use in real-time applications. This paper highlights a technique to speed up the overall compression process through introduction of a prediction pre-processor stage. A variety of predictors are applied to two variati...

In this paper, a natural extension of the Lempel-Ziv complexity for several finitetime sequences, defined on finite size alphabets is proposed. Some results on the defined joint Lempel-Ziv complexity are given, as well as properties in connection with the Lempel-Ziv complexity of the individual sequences. Also, some links with Shannon entropies are exhibited and, by analogy, some derived quanti...

The Ziv-Lempel complexity is a well-known complexity measure. In our paper we consider the Ziv-Lempel complexity for p'eriodic sequences as well as for pseudorandom number sequences. Further on, we will look at i ts cryptographic significance and compare it with other complexity measures such as the linear complexity.

When transmitting the data in digital communication, it is well desired that bits should be as minimal possible, so many techniques are used to compress data. In this paper, a Lempel-Ziv algorithm for compression was implemented through VHDL coding. One of most lossless algorithms commonly Lempel-Ziv. The work paper devoted improve rate, space-saving, and utilization using systolic array approa...

In this correspondence we investigate the performance of the Lempel–Ziv incremental parsing scheme on nonstationary sources. We show that it achieves the best rate achievable by a finite-state block coder for the nonstationary source. We also show a similar result for a lossy coding scheme given by Yang and Kieffer which uses a Lempel–Ziv scheme to perform lossy coding.

We present the first thorough practical study of the Lempel-Ziv-78 and the Lempel-Ziv-Welch computation based on trie data structures. With a careful selection of trie representations we can beat well-tuned popular trie data structures like Judy, m-Bonsai or Cedar.

The properties of maximum Lempel-Ziv complexity strings are studied for the binary case. A comparison between MLZs and random strings is carried out. The length profile of both type of sequences show different distribution functions. The non-stationary character of the MLZs are discussed. The issue of sensitiveness to noise is also addressed. An empirical ansatz is found that fits well to the L...