A constrained-dictionary version of LZ78 asymptotically achieves the finite-state compressibility with a distortion measure

J Ziv - 2015 IEEE Information Theory Workshop (ITW), 2015 - ieeexplore.ieee.org
The unrestricted-dictionary type LZ78 universal data-compression algorithm (as well as the
LZ77 and LZW versions) achieves asymptotically, as the block-length tends to infinity, the FS
compressibility, namely the best compression-ratio that may be achieved by any Information-
lossless (IL) block-to-variable finite-state (FS) algorithm, for any infinitely-long individual
sequence.

A Constrained-Dictionary version of LZ78 asymptotically achieves the Finite-State Compressibility for any Individual Sequence with a Distortion measure

J Ziv - arXiv preprint arXiv:1409.1323, 2014 - arxiv.org
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
compressibility, namely the best compression-ratio that may be achieved by any Information-
lossless (IL) block-to-variable finite-state (FS) algorithm, for any infinitely-long individual
sequence. The encoder parses the sequence into distinct phrases where each newly
generated phrase is a past phrase which is already stored in a dictionary, extended by one …
Showing the best results for this search. See all results