Universal Data Compression Algorithm Based on Approximate String Matching

DOI10.1017/S0269964800004502MaRDI QIDQ5485382zbMATH OpenOpenAlexFDO

Authors I. Sadeh

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

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 868046
• Optimal data compression algorithm
• On the performance of data compression algorithms based upon string matching
• A suboptimal lossy data compression based on approximate pattern matching
• scientific article; zbMATH DE number 1187491

Cites work

• A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
• A sandwich proof of the Shannon-McMillan-Breiman theorem
• A Space-Economical Suffix Tree Construction Algorithm
• A universal algorithm for sequential data compression
• An algorithm for source coding subject to a fidelity criterion, based on string matching
• Asymptotical growth of a class of random trees
• Coding theorems for individual sequences
• Compression of individual sequences via variable-rate coding
• Data structures and algorithms for approximate string matching
• Entropy and data compression schemes
• scientific article; zbMATH DE number 4116450 (Why is no real title available?)
• Linear Algorithm for Data Compression via String Matching
• On the notion of recurrence in discrete stochastic processes
• Sliding-block source coding
• Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
• Suffix Arrays: A New Method for On-Line String Searches
• The Erdős-Rényi law in distribution, for coin tossing and sequence matching
• The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches
• The Individual Ergodic Theorem of Information Theory
• The Lempel-Ziv algorithm and message complexity
• Universal almost sure data compression
• Universal codeword sets and representations of the integers
• Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm

Cited in

(8)

• Optimal data compression algorithm
• scientific article; zbMATH DE number 2086336 (Why is no real title available?)
• An Algorithm for Universal Lossless Compression With Side Information
• scientific article; zbMATH DE number 1187491 (Why is no real title available?)
• An algorithm for source coding subject to a fidelity criterion, based on string matching
• On the performance of data compression algorithms based upon string matching
• scientific article; zbMATH DE number 868046 (Why is no real title available?)
• Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm

This page was built for publication: Universal Data Compression Algorithm Based on Approximate String Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485382)