A universal algorithm for sequential data compression
From MaRDI portal
Publication:4158937
DOI10.1109/TIT.1977.1055714zbMATH Open0379.94010DBLPjournals/tit/ZivL77WikidataQ55921954 ScholiaQ55921954MaRDI QIDQ4158937FDOQ4158937
Authors: Jacob Ziv, Abraham Lempel 
Publication date: 1977
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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)
- Burrows-Wheeler compression: Principles and reflections
- UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS
- Variable-length codes independent or closed with respect to edit relations
- Structure-generating mechanisms in agent-based models
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
- Dynamic-history predictive compression
- Zipping thermal ratchets
- The fractional greedy algorithm for data compression
- A universal online caching algorithm based on pattern matching
- Adaptive text mining: inferring structure from sequences
- Title not available (Why is that?)
- Phase transitions in tumor growth. III: Vascular and metastasis behavior
- Comparison of LZ77-type parsings
- An Efficient Scheme for Joint Compression and Encryption
- Complexity analysis to explore the structure of ancient stromatolites
- WORD COMPLEXITY AND REPETITIONS IN WORDS
- Optimal data compression algorithm
- A separation between RLSLPs and LZ77
- Universal data compression and repetition times
- Contrasting stochasticity with chaos in a permutation Lempel-Ziv complexity -- Shannon entropy plane
- Compression in the presence of shared data
- Phase transitions in tumor growth. VI: Epithelial-mesenchymal transition
- Efficient parallel algorithms to test square-freeness and factorize strings
- Compressed depth sequences
- Generative complexity of Gray-Scott model
- Sublinear algorithms for approximating string compressibility
- Practical and flexible pattern matching over Ziv-Lempel compressed text.
- Fast distance multiplication of unit-Monge matrices
- Large-scale detection of repetitions
- Lossless compression and information hiding in images
- XML compression techniques: A survey and comparison
- An Introduction to Neural Data Compression
- Estimation of the Entropy Rate of a Countable Markov Chain
- Parallel Lempel Ziv coding
- Partial words and the critical factorization theorem
- Title not available (Why is that?)
- Compressed parameterized pattern matching
- Combinatorics on partial word correlations
- Phylogenetic inference from binary sequences reduced by primary DNA sequences
- Lossless sliding-block compression of constrained systems
- Second step algorithms in the Burrows-Wheeler compression algorithm
- Randomized prediction of individual sequences
- Universal almost sure data compression
- CONVERGENCE OF C0 COMPLEXITY
- Title not available (Why is that?)
- Title not available (Why is that?)
- Predictive analog-to-digital conversion for resistance to data outliers
- Title not available (Why is that?)
- On processes which cannot be distinguished by finite observation
- Toward an abstract theory of data compression
- Text compression methods
- LZ-End Parsing in Linear Time
- Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes
- Title not available (Why is that?)
- Aim functions and sequential estimation of the source model for universal coding
- A circuit complexity formulation of algorithmic information theory
- Two-pattern strings. I: A recognition algorithm
- On Sensitivity of Compact Directed Acyclic Word Graphs
- A universal statistical test for random bit generators
- Balancing and clustering of words in the Burrows-Wheeler transform
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- Compact q-gram profiling of compressed strings
- Efficient algorithms for three variants of the LPF table
- Quasi-distinct parsing and optimal compression methods
- Parameterized longest previous factor
- Algorithmic folding complexity
- The greedy approach to dictionary-based static text compression on a distributed system
- Convergence of recurrence of blocks for mixing processes
- Title not available (Why is that?)
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Replacing suffix trees with enhanced suffix arrays
- Efficient algorithms for Lempel-Ziv encoding
- Computing longest previous factor in linear time and applications
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- Title not available (Why is that?)
- Efficient fully-compressed sequence representations
- Bacterial DNA sequence compression models using artificial neural networks
- Collage system: A unifying framework for compressed pattern matching.
- Fuzzy relation equations for coding/decoding processes of images and videos
- Phase transition in a generalized Eden growth model on a tree
- Analytical depoissonization and its applications
- Congruence Closure of Compressed Terms in Polynomial Time
- Computing regularities in strings: a survey
- Fast equality test for straight-line compressed strings
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- A diffusion limit for a class of randomly-growing binary trees
- Optimal encoding of non-stationary sources
- On optimal parsing for LZ78-like compressors
- FM-index of alignment: a compressed index for similar strings
- A novel block-based scheme for arithmetic coding
- On compressing and indexing repetitive sequences
- Multivariate permutation entropy and its application for complexity analysis of chaotic systems
- Personalized multi-user view and content synchronization and retrieval in real-time mobile social software applications
- Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics
- Linear-time text compression by longest-first substitution
- Optimal partitioning of data chunks in deduplication systems
- The “Runs” Theorem
- The three squares lemma revisited
- Time-space trade-offs for compressed suffix arrays.
- Note on the greedy parsing optimality for dictionary-based text compression
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)
