A universal algorithm for sequential data compression

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

Mathematics Subject Classification ID

Communication theory (94A05) Source coding (94A29)

Cited In (only showing first 100 items - show all)

• Burrows-Wheeler compression: Principles and reflections
• 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.
• Universal coding and prediction on ergodic random points
• 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 C₀ 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
• Redundancy estimates for the Lempel–Ziv algorithm of data compression
• Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes
• Title not available (Why is that?)
• On the palindromic zl-factorization and c-factorization of the generalized period-doubling sequences
• Worst-case analysis for on-line data compression
• Title not available (Why is that?)
• Rényi entropy and pattern matching for run-length encoded sequences
• Variance of entropy for testing time-varying regimes with an application to meme stocks
• Inline vector compression for computational physics
• Pushdown and Lempel-Ziv depth
• Fountain codes for lossless data compression
• Ziv-Lempel and Crochemore factorizations of the generalized period-doubling word
• De Novo NGS Data Compression
• An example of mathematical authorship attribution
• An Opportunistic Text Indexing Structure Based on Run Length Encoding
• Semiconductor Emitters in Entropy Sources for Quantum Random Number Generation
• Selective dynamic compression
• Synchronizing dynamic Huffman codes
• Compression using lossless decimation: analysis and application
• Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
• Title not available (Why is that?)
• Mathematical models of textual data: a short review
• LZ78 compression in low main memory space
• Engineering practical Lempel-Ziv tries
• String Indexing with Compressed Patterns
• Internal pattern matching queries in a text and applications
• A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences
• Linear-size suffix tries and linear-size CDAWGs simplified and improved
• Faster sequential universal coding via block partitioning
• Towards clean reversible lossless compression. A reversible programming experiment with zip
• An Algorithm for Universal Lossless Compression With Side Information
• Entropy estimate by a randomness criterion
• A comprehensive taxonomy of cellular automata
• Adaptive arithmetic coding using fuzzy reasoning and grey prediction
• Arithmetics on suffix arrays of Fibonacci words
• A lossless compression algorithm for integer difference sequences by optimization of their division into intervals of constant bit depth values
• Bicriteria data compression
• Exact and inexact search for 2d side-sharing tandems
• Title not available (Why is that?)
• The Vcodex Platform for Data Compression
• Dense non-binary Fibonacci codes
• Simulation study of an ultrasonic signal compression
• On two LZ78-style grammars: compression bounds and compressed-space computation

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)