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...

We consider the communication complexity of Hamming distance two strings. Bille et al. [SPIRE 2018] considered longest common prefix (LCP) problem in setting where parties have their strings a compressed form, i.e., represented by Lempel-Ziv 77 factorization (LZ77) with/without self-references. present randomized public-coin protocol for joint computation LZ77 without Although our scheme is hea...

This paper expands upon existing and introduces new formulations of Bennett's logical depth. In previously published work by Jordon Moser, notions finite-state-depth pushdown-depth were examined compared. These based on finite-state transducers information lossless pushdown compressors respectively. Unfortunately a full separation between the two was not established. formulation restricting how...

We introduce a distributed source coding scheme called successive Wyner-Ziv coding scheme. We show that any point in the rate region of the quadratic Gaussian CEO problem can be achieved via the successive Wyner-Ziv coding. The notion of successive refinement in the single source coding is generalized to the distributed source coding scenario, which we refer to as distributed successive refinem...

With ideas from data compression and combinatorics on words, we introduce a complexity measure for words, called repetition complexity, which quantifies the amount of repetition in a word. The repetition complexity of w, r(w), is defined as the smallest amount of space needed to store w when reduced by repeatedly applying the following procedure: n consecutive occurrences uu . . . u of the same...

We introduce a general framework which is suitable to capture the essence of compressed pattern matching according to various dictionary-based compressions. It is a formal system to represent a string by a pair of dictionary D and sequence S of phrases in D. The basic operations are concatenation, truncation, and repetition. We also propose a compressed pattern matching algorithm for the framew...

Given a text T [1..u] over an alphabet of size σ = O(polylog(u)) and with k-th order empirical entropy Hk(T ), we propose a new compressed full-text self-index based on the Lempel-Ziv (LZ) compression algorithm, which replaces T with a representation requiring about three times the size of the compressed text, i.e (3+ ǫ)uHk(T )+ o(u log σ) bits, for any ǫ > 0 and k = o(log σ u), and in addition...

BACKGROUND The complexity of the intracranial pressure (ICP) signal decreases with intracranial hypertension in children with acute brain injury as well as during infusion studies in adults with hydrocephalus. In this study we have analysed the pressure signal obtained in the lumbar subarachnoid space during infusion testing. The pulse amplitude rises when the ICP is increased by additional ext...

The Fixed-Database version of the Lempel Ziv algorithm closely resembles many versions that appear in practice. In this paper, we ascertain several key asymptotic properties of the algorithm as applied to sources with nite memory. First, we determine that for a dictionary of size n, the algorithm achieves a redundancy n = H log log n log n + o(log log n log n), where H is the entropy of the pro...

The distributed video coding paradigm enables video codecs to operate with reversed complexity, in which the complexity is shifted from the encoder toward the decoder. Its performance is heavily dependent on the quality of the side information generated by motio estimation at the decoder. We compare the rate-distortion performance of different side-information estimators, for both temporally an...