1 citations · 1 across the 7 of their papers we have counts for
7 papers
Efficient Compression of Long Arbitrary Sequences with No Reference at the Encoder
Yuval Cassuto, Jacob Ziv
In a distributed information application an encoder compresses an arbitrary vector while a similar reference vector is available to the decoder as side information. For the Hamming…
A Constrained-Dictionary version of LZ78 asymptotically achieves the Finite-State Compressibility for any Individual Sequence with a Distortion measure
Jacob Ziv
The unrestricted LZ78 universal data-compression algorithm (as well as the LZ77 and LZW versions) achieves asymptotically, as the block-length tends to infinity, the FS compressibi…
A Note on the Compaction of long Training Sequences for Universal Classification -a Non-Probabilistic Approach
Jacob Ziv
One of the central problems in the classification of individual test sequences (e.g. genetic analysis), is that of checking for the similarity of sample test sequences as compared…
On the optimality of universal classifiers for finite-length individual test sequences
Jacob Ziv
We consider pairs of finite-length individual sequences that are realizations of unknown, finite alphabet, stationary sources in a clas M of sources with vanishing memory (e.g. sta…
On Finite Memory Universal Data Compression and Classification of Individual Sequences
Jacob Ziv
Consider the case where consecutive blocks of N letters of a semi-infinite individual sequence X over a finite-alphabet are being compressed into binary sequences by some one-to-on…
On context-tree prediction of individual sequences
Jacob Ziv, Neri Merhav
Motivated by the evident success of context-tree based methods in lossless data compression, we explore, in this paper, methods of the same spirit in universal prediction of indivi…