Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
From MaRDI portal
Publication:1945151
Recommendations
- An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
- On the performance of data compression algorithms based upon string matching
- Achievable complexity-performance tradeoffs in lossy compression
- Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
- Arbitrary source models and Bayesian codebooks in rate-distortion theory
Cites work
- scientific article; zbMATH DE number 3908323 (Why is no real title available?)
- scientific article; zbMATH DE number 1278022 (Why is no real title available?)
- scientific article; zbMATH DE number 467196 (Why is no real title available?)
- scientific article; zbMATH DE number 1049269 (Why is no real title available?)
- scientific article; zbMATH DE number 2061729 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- scientific article; zbMATH DE number 3318548 (Why is no real title available?)
- A 2-cycle algorithm for source coding with a fidelity criterion
- A coding theorem for lossy data compression by LDPC codes
- A suboptimal lossy data compression based on approximate pattern matching
- A survey of the theory of source coding with a fidelity criterion
- A universal algorithm for sequential data compression
- A vector quantization approach to universal noiseless coding and quantization
- Achievable complexity-performance tradeoffs in lossy compression
- An Introduction to Arithmetic Coding
- An algorithm for source coding subject to a fidelity criterion, based on string matching
- An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
- An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
- An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models
- Coding of sources with unknown statistics--II: Distortion relative to a fidelity criterion
- Coding theorems for individual sequences
- Compression of individual sequences via variable-rate coding
- Construction and evaluation of trellis-coded quantizers for memoryless sources
- Distortion-rate theory for individual sequences
- Elements of Information Theory
- Expander codes
- Fixed rate universal block source coding with a fidelity criterion
- Fixed-slope universal lossy data compression
- Generalized Kraft Inequality and Arithmetic Coding
- Good codes based on very sparse matrices
- Modern Coding Theory
- Natural type selection in adaptive lossy compression
- Nonlinear Sparse-Graph Codes for Lossy Compression
- On the performance of data compression algorithms based upon string matching
- Pointwise redundancy in lossy data compression and universal lossy data compression
- Quantization
- Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding
- Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
- Source coding, large deviations, and approximate pattern matching
- The asymptotics of waiting times between stationary processes, allowing distortion
- Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion
- Tree encoding of memoryless time-discrete sources with a fidelity criterion
- Trellis Encoding of memoryless discrete-time sources with a fidelity criterion
- Universal almost sure data compression
Cited in
(5)- An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
- Mismatched codebooks and the role of entropy coding in lossy data compression
- Achievable complexity-performance tradeoffs in lossy compression
- On the performance of recency-rank and block-sorting universal lossless data compression algorithms
- Pattern matching and lossy data compression on random fields
This page was built for publication: Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1945151)
