A universal algorithm for sequential data compression

Recommendations

Compressed Data Structures for Dynamic Sequences
A sequential algorithm for the universal coding of finite memory sources
Combinatorial compression algorithms for ordered record sequences
scientific article; zbMATH DE number 503181
Universal almost sure data compression
Universal data compression based on the Burrows-Wheeler transformation: theory and practice
Inequalities and algorithms for universal data compression
Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity

Cited in

(only showing first 100 items - show all)

Compressed depth sequences
Randomized prediction of individual sequences
An Introduction to Neural Data Compression
Fast distance multiplication of unit-Monge matrices
Aim functions and sequential estimation of the source model for universal coding
Variable-length codes independent or closed with respect to edit relations
Large-scale detection of repetitions
CONVERGENCE OF C₀ COMPLEXITY
Phylogenetic inference from binary sequences reduced by primary DNA sequences
Estimation of the Entropy Rate of a Countable Markov Chain
Universal data compression and repetition times
Combinatorics on partial word correlations
scientific article; zbMATH DE number 503181 (Why is no real title available?)
Lossless sliding-block compression of constrained systems
Lossless compression and information hiding in images
WORD COMPLEXITY AND REPETITIONS IN WORDS
Universal almost sure data compression
scientific article; zbMATH DE number 3621627 (Why is no real title available?)
Sublinear algorithms for approximating string compressibility
Practical and flexible pattern matching over Ziv-Lempel compressed text.
Predictive analog-to-digital conversion for resistance to data outliers
Partial words and the critical factorization theorem
Burrows-Wheeler compression: Principles and reflections
Structure-generating mechanisms in agent-based models
scientific article; zbMATH DE number 2086336 (Why is no real title available?)
scientific article; zbMATH DE number 4174823 (Why is no real title available?)
Phase transitions in tumor growth. III: Vascular and metastasis behavior
On processes which cannot be distinguished by finite observation
Comparison of LZ77-type parsings
An Efficient Scheme for Joint Compression and Encryption
Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes
Contrasting stochasticity with chaos in a permutation Lempel-Ziv complexity -- Shannon entropy plane
Compressed parameterized pattern matching
Text compression methods
Compression in the presence of shared data
XML compression techniques: A survey and comparison
Phase transitions in tumor growth. VI: Epithelial-mesenchymal transition
A circuit complexity formulation of algorithmic information theory
Optimal data compression algorithm
Universal coding and prediction on ergodic random points
scientific article; zbMATH DE number 1421006 (Why is no real title available?)
Complexity analysis to explore the structure of ancient stromatolites
Efficient parallel algorithms to test square-freeness and factorize strings
Dynamic-history predictive compression
A universal online caching algorithm based on pattern matching
Toward an abstract theory of data compression
LZ-End Parsing in Linear Time
Generative complexity of Gray-Scott model
Two-pattern strings. I: A recognition algorithm
Zipping thermal ratchets
Second step algorithms in the Burrows-Wheeler compression algorithm
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
Parallel Lempel Ziv coding
scientific article; zbMATH DE number 78498 (Why is no real title available?)
The fractional greedy algorithm for data compression
Adaptive text mining: inferring structure from sequences
A separation between RLSLPs and LZ77
scientific article; zbMATH DE number 4045113 (Why is no real title available?)
Deterministic compression with uncertain priors
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
Parallel algorithms for Burrows-Wheeler compression and decompression
Relative entropy via non-sequential recursive pair substitution
Exploring the dynamics of dyadic interactions via hierarchical segmentation
Towards approximate matching in compressed strings: local subsequence recognition
Practical fixed length Lempel-Ziv coding
Faster subsequence and don't-care pattern matching on compressed texts
Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach
Personalized multi-user view and content synchronization and retrieval in real-time mobile social software applications
Comparative construction of plug-in estimators of the entropy rate of two-state Markov chains
\(LZ\)-based image compression
Parallelism and dictionary based data compression
Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
A complexity-based measure and its application to phylogenetic analysis
A compressed dynamic self-index for highly repetitive text collections
Leaf languages and string compression
Variations of the parameterized longest previous factor
A review on the application of fuzzy transform in data and image compression
A worst-case analysis of the LZ2 compression algorithm
Data compression and learning in time sequences analysis
A faster implementation of online RLBWT and its application to LZ77 parsing
Phylogenetic analysis of DNA sequences based on the generalized pseudo-amino acid composition
Compressing table data with column dependency
A fast dynamic compression scheme for natural language texts
Truncated suffix trees and their application to data compression.
On the algorithmic complexity of static structures
Universally typical sets for ergodic sources of multidimensional data
On the approximation ratio of LZ-end to LZ77
Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
A motion compression/reconstruction method based on max t-norm composite fuzzy relational equations
Computing longest previous non-overlapping factors
Progress, gaps and obstacles in the classification of cellular automata
On-line versus off-line computation in dynamic text compression
Adaptive learning of compressible strings
Compror: On-line lossless data compression with a factor oracle.
Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data
An empirical study of the complexity and randomness of prediction error sequences
Fast algorithms for finding a minimum repetition representation of strings and trees
Improving the efficiency of the PPM algorithm
Is Huffmann coding dead?
Computing maximal-exponent factors in an overlap-free word

This page was built for publication: A universal algorithm for sequential data compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158937)