Optimal data compression algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3959271
- Error-Resilient Optimal Data Compression
- Data compression
- scientific article; zbMATH DE number 1792105
- Iterative compression and exact algorithms
- Iterative Compression and Exact Algorithms
- scientific article; zbMATH DE number 4045113
- Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics
- MICAI 2004: Advances in Artificial Intelligence
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 suboptimal lossy data compression based on approximate pattern matching
- 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 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 48436 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 4116450 (Why is no real title available?)
- scientific article; zbMATH DE number 763790 (Why is no real title available?)
- Linear Algorithm for Data Compression via String Matching
- On the notion of recurrence in discrete stochastic processes
- Optimal data compression algorithm
- Pattern matching in a digitized image
- 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
- Universal Data Compression Algorithm Based on Approximate String Matching
- Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
Cited in
(12)- Rearranging data to maximize the efficiency of compression
- Optimal data compression algorithm
- Data compression under constraints of causality and variable finite memory
- scientific article; zbMATH DE number 1187491 (Why is no real title available?)
- 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
- A novel algorithm for text data compression based on arithmetic codec
- Universal Data Compression Algorithm Based on Approximate String Matching
- Optimal encoding of non-stationary sources
- An adaptive character wordlength algorithm for data compression
- A novel lossless data compression scheme based on the error correcting Hamming codes
This page was built for publication: Optimal data compression algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1816650)
