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
Compression of FASTQ and SAM format sequencing data.
TL;DR: Several compression entries from the SequenceSqueeze contest are presented, including the winning entry, and the tools are shown to be the new Pareto frontier for FASTQ compression, offering state of the art ratios at affordable CPU costs.
Patent
System and method for incremental and continuous data compression
TL;DR: In this article, a data compression system and method for that is capable of detecting and eliminating repeated phrases of variable length within a window of virtually unlimited size is presented, and the method is used to detect and eliminate repeated phrases.
Journal ArticleDOI
Complexity of strings in the class of Markov sources
TL;DR: Shannon's self-information of a string is generalized to its complexity relative to the class of finite-state-machine (FSM) defined sources by a theorem stating that, asymptotically, the mean complexity provides a tight lower bound for the mean length of all so-called regular codes.
Journal ArticleDOI
Mobility-based predictive call admission control and bandwidth reservation in wireless cellular networks
Fei Yu,Victor C. M. Leung +1 more
TL;DR: This paper presents call admission control and bandwidth reservation schemes in wireless cellular networks that have been developed based on assumptions more realistic than existing proposals, and adaptively control the admission threshold to achieve a better balance between guaranteeing handoff dropping probability and maximizing resource utilization.
Proceedings ArticleDOI
Optimal prefetching via data compression
Jeffrey Scott Vitter,P. Krishnan +1 more
TL;DR: It is shown for powerful models and mth order Markov sources that the page fault rates incurred by the prefetching algorithms presented are optimal in the limit for almost all sequences of page accesses.
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.