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
Balancing and clustering of words in the Burrows-Wheeler transform
Antonio Restivo,Giovanna Rosone +1 more
TL;DR: Empirical observations suggest that balance is actually the combinatorial property of input word that ensure optimal BWT compression, and this hypothesis is corroborated by experiments on ''real'' text, by using local entropy as a measure of the degree of balance of a word.
Proceedings ArticleDOI
Split-stream dictionary program compression
TL;DR: SSDenton et al. as mentioned in this paper proposed a split-stream dictionary (SSD) compression, which enables interpreters or just-in-time translators to decompress basic blocks incrementally during program execution.
Patent
Multi-codebook coding process
TL;DR: An improved multi-codebook phase-in coding process for coding electronic data was proposed in this paper, where for each received electronic input data, the coding process detects whether that input data exceeds a current coding maximum, then selecting a codebook coding method from one or more codebook Coding methods in response to detecting whether that data exceeds the current Coding maximum, and then encoding that input input data in accordance to the selected codebook coding method to generate a coded output data.
Dissertation
Predicting Future Locations and Arrival Times of Individuals
TL;DR: The approach used in this dissertation is the first to predict when someone will arrive at any given location, and shows the characteristics of the timestamped, location data which lead to the highest number of correct predictions.
Patent
Semi-static data compression/expansion method
TL;DR: In this article, a method of transmitting compressed data using a Ziv-Lempel compression/expansion algorithm, using an adaptive Ziv Lempel (AZL) dictionary modified to a mature state, is presented.
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.