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)

String Indexing with Compressed Patterns
scientific article; zbMATH DE number 1421009 (Why is no real title available?)
Internal pattern matching queries in a text and applications
Fast Exponentiation Using Data Compression
De Novo NGS Data Compression
On the palindromic zl-factorization and c-factorization of the generalized period-doubling sequences
scientific article; zbMATH DE number 7765406 (Why is no real title available?)
Faster sequential universal coding via block partitioning
Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
Bicriteria data compression
Universal Lossless Compression of Erased Symbols
Inline vector compression for computational physics
Pushdown and Lempel-Ziv depth
Redundancy estimates for the Lempel–Ziv algorithm of data compression
Selective dynamic compression
Synchronizing dynamic Huffman codes
Exact and inexact search for 2d side-sharing tandems
Largest repetition factorization of Fibonacci words
Non-overlapping indexing in BWT-runs bounded space
On the number of factors in the LZ-End factorization
scientific article; zbMATH DE number 1192494 (Why is no real title available?)
Sublinear time Lempel-Ziv (LZ77) factorization
Ziv-Lempel and Crochemore factorizations of the generalized period-doubling word
Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression
Variance of entropy for testing time-varying regimes with an application to meme stocks
A comprehensive taxonomy of cellular automata
A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS
An Opportunistic Text Indexing Structure Based on Run Length Encoding
Fountain codes for lossless data compression
Adaptive arithmetic coding using fuzzy reasoning and grey prediction
Semiconductor Emitters in Entropy Sources for Quantum Random Number Generation
On the computation of longest previous non-overlapping factors
Rpair: rescaling RePair with Rsync
Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes
Towards clean reversible lossless compression. A reversible programming experiment with zip
Compression using lossless decimation: analysis and application
Mathematical models of textual data: a short review
LZ78 compression in low main memory space
A new model of numerical computer data and its application for construction of minimum-redundancy codes
The Vcodex Platform for Data Compression
Machine-learning iterative calculation of entropy for physical systems
A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences
Worst-case analysis for on-line data compression
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
Entropy estimate by a randomness criterion
Random access in persistent strings and segment selection
Rényi entropy and pattern matching for run-length encoded sequences
An example of mathematical authorship attribution
Linear-size suffix tries and linear-size CDAWGs simplified and improved
An Algorithm for Universal Lossless Compression With Side Information
Simulation study of an ultrasonic signal compression
On two LZ78-style grammars: compression bounds and compressed-space computation
Data structures for computing unique palindromes in static and non-static strings
Engineering practical Lempel-Ziv tries
Dense non-binary Fibonacci codes
A new algorithm for compression of partially commutative alphabets
scientific article; zbMATH DE number 49083 (Why is no real title available?)
Haar-like wavelets on hierarchical trees
Artificial sequences and complexity measures
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

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)