Journal ArticleDOI
Compression of individual sequences via variable-rate coding
Jacob Ziv,A. Lempel +1 more
TLDR
The proposed concept of compressibility is shown to play a role analogous to that of entropy in classical information theory where one deals with probabilistic ensembles of sequences rather than with individual sequences.Abstract:
Compressibility of individual sequences by the class of generalized finite-state information-lossless encoders is investigated. These encoders can operate in a variable-rate mode as well as a fixed-rate one, and they allow for any finite-state scheme of variable-length-to-variable-length coding. For every individual infinite sequence x a quantity \rho(x) is defined, called the compressibility of x , which is shown to be the asymptotically attainable lower bound on the compression ratio that can be achieved for x by any finite-state encoder. This is demonstrated by means of a constructive coding theorem and its converse that, apart from their asymptotic significance, also provide useful performance criteria for finite and practical data-compression tasks. The proposed concept of compressibility is also shown to play a role analogous to that of entropy in classical information theory where one deals with probabilistic ensembles of sequences rather than with individual sequences. While the definition of \rho(x) allows a different machine for each different sequence to be compressed, the constructive coding theorem leads to a universal algorithm that is asymptotically optimal for all sequences.read more
Citations
More filters
Journal ArticleDOI
Building a Better Mousetrap: Compressing Mouse Cursor Activity for Web Analytics
Luis A. Leiva,Jeff Huang +1 more
TL;DR: This work investigates methods to compress cursor data, taking advantage of the fact that not every cursor coordinate has equal value to the website developer, and evaluates 5 lossless and 5 lossy compression algorithms over two datasets.
Proceedings ArticleDOI
Generalized Deduplication: Bounds, Convergence, and Asymptotic Properties.
TL;DR: It is shown that even for a simple case of generalized deduplication, the gain in convergence speed is linear with the size of the data chunks, which means that generalized dedUplication can provide compression benefits much earlier than classic deduPLication, which is key in practical systems.
Book ChapterDOI
The impact of spatial resolution and representation on human mobility predictability
TL;DR: This work replicates earlier cell tower based predictability analyses with granular spatial and temporal multisensory data, and demonstrates a spatial resolution dependence of entropy, while reinforcing the claims of inherent predictability of human mobility advanced in early works.
Journal IssueDOI
New adaptive compressors for natural language text
TL;DR: This paper designs adaptive variants of the recently proposed family of dense compression codes, showing that they are much simpler and faster than dynamic Huffman codes and reach almost the same compression effectiveness.
Proceedings ArticleDOI
Data compression in the V.42bis modems
A. Lettieri,K. Holtz,E. Holtz +2 more
TL;DR: A first international data compression standard became available when the CCITT adopted the V.42bis standard in 1990 and is now used by more than 50 modem manufacturers and is rapidly, spreading into Local and Remote Area Networks (LANs, WANs).
References
More filters
Book
Information Theory and Reliable Communication
TL;DR: This chapter discusses Coding for Discrete Sources, Techniques for Coding and Decoding, and Source Coding with a Fidelity Criterion.
Journal ArticleDOI
A universal algorithm for sequential data compression
Jacob Ziv,A. Lempel +1 more
TL;DR: The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable- to-block codes designed to match a completely specified source.
Journal ArticleDOI
On the Complexity of Finite Sequences
A. Lempel,Jacob Ziv +1 more
TL;DR: A new approach to the problem of evaluating the complexity ("randomness") of finite sequences is presented, related to the number of steps in a self-delimiting production process by which a given sequence is presumed to be generated.
Journal ArticleDOI
Coding theorems for individual sequences
TL;DR: The finite-state complexity of a sequence plays a role similar to that of entropy in classical information theory (which deals with probabilistic ensembles of sequences rather than an individual sequence).
Journal ArticleDOI
On Information Lossless Automata of Finite Order
TL;DR: The application of the tests to finite deterministic automata is discussed and a method of constructing a decoder for a given finite automaton that is information lossless of finite order, is described.