Optimal data compression algorithm
From MaRDI portal
Publication:1816650
DOI10.1016/0898-1221(96)00135-6zbMath0856.68072OpenAlexW2048435957MaRDI QIDQ1816650
Publication date: 3 February 1997
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(96)00135-6
Parallel algorithms in computer science (68W10) Data structures (68P05) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Erdős-Rényi law in distribution, for coin tossing and sequence matching
- Universal almost sure data compression
- Asymptotical growth of a class of random trees
- Data structures and algorithms for approximate string matching
- A sandwich proof of the Shannon-McMillan-Breiman theorem
- The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches
- Pattern matching in a digitized image
- Optimal data compression algorithm
- Suffix Arrays: A New Method for On-Line String Searches
- Coding theorems for individual sequences
- The Individual Ergodic Theorem of Information Theory
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
- Linear Algorithm for Data Compression via String Matching
- Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
- The Lempel-Ziv algorithm and message complexity
- Entropy and data compression schemes
- Universal codeword sets and representations of the integers
- Sliding-block source coding
- A Space-Economical Suffix Tree Construction Algorithm
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- An algorithm for source coding subject to a fidelity criterion, based on string matching
- A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
- A suboptimal lossy data compression based on approximate pattern matching
- Universal Data Compression Algorithm Based on Approximate String Matching
- On the notion of recurrence in discrete stochastic processes
This page was built for publication: Optimal data compression algorithm
