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
Proceedings ArticleDOI
Lempel-Ziv compression of structured text
TL;DR: A novel Lempel-Ziv approach suitable for compressing structured documents, called LZCS, which takes advantage of redundant information that can appear in the structure, and is especially efficient to compress collections of highly structured data.
Book ChapterDOI
Optimal Parsing of Strings
Alan Hartman,Michael Rodeh +1 more
TL;DR: Parsing of strings has been suggested by Lempel and Ziv, as a tool to define the complexity of strings and to compress them and recently it was shown that the scheme may be modified to handle two dimensional data.
Journal ArticleDOI
A study on word-based and integral-bit Chinese text compression algorithms
TL;DR: It is shown that the cascaded algorithm is more suitable for practical usage, and among several word-based integral-bit compression algorithms, WLZSSHUF achieves the best compression results.
Book ChapterDOI
Anticipatory Model of Musical Style Imitation Using Collaborative and Competitive Reinforcement Learning
TL;DR: This paper provides a first attempt to model some aspects of musical expectation specifically pertained to short-time and working memories, in an anticipatory framework, and demonstrates complex musical behavior such as long-term planning and formal shapes as a result of the anticipatory architecture.
Towards Efficient Archiving of Dynamic Linked Open Data.
TL;DR: Current techniques addressing the problem of archiving different versions of semantic Web data are surveyed and analysed, with a focus on their space efficiency, the retrieval functionality they serve, and the performance of such operations.
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.