Universal Data Compression Algorithm Based on Approximate String Matching
From MaRDI portal
Publication:5485382
DOI10.1017/S0269964800004502zbMath1094.94503OpenAlexW2104550348MaRDI QIDQ5485382
Publication date: 30 August 2006
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964800004502
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)
Related Items
Cites Work
- 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
- 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
- On the notion of recurrence in discrete stochastic processes
