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
Prediction in wireless networks by Markov chains
TL;DR: Information-theoretic techniques for discrete sequence prediction are presented, surveys, classifies, and compares the state-of-the-art solutions, suggesting routes for further research by discussing the critical issues and challenges of prediction in wireless networks.
Proceedings Article
Guessing the Composer's Mind: Applying Universal Prediction to Musical Style
TL;DR: A dictionary based universal prediction algorithm that provides a very general and flexible approach to machine learning in the domain of musical style and such operations as improvisation or assistance to composition can be realized on the resulting representations.
Book ChapterDOI
Towards Behaviometric Security Systems: Learning to Identify a Typist
TL;DR: A learning algorithm is developed, which can rather accurately learn to authenticate and protect users, based on a simple extension of the well known Lempel-Ziv universal compression algorithm.
Journal ArticleDOI
Level of consciousness is dissociable from electroencephalographic measures of cortical connectivity, slow oscillations, and complexity
Dinesh Pal,Duan Li,Jon G. Dean,Michael A. Brito,Tiecheng Liu,Anna M. Fryzel,Anthony G. Hudetz,George A. Mashour +7 more
TL;DR: Whether an animal exhibits wakefulness or not can be dissociated from cortical connectivity, oscillations, and dynamics is concluded, prompting a reevaluation of the role of connectivity in level of consciousness.
Proceedings ArticleDOI
Adaptive online data compression
Emmanuel Jeannot,B. Knutsson +1 more
TL;DR: An algorithm is explored and enhanced that allows us to overlap communications with compression and to automatically adapt the compression effort to currently available network and processor resources.
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.