Achievable complexity-performance tradeoffs in lossy compression
From MaRDI portal
Recommendations
- Pointwise redundancy in lossy data compression and universal lossy data compression
- An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
- Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. I: The regular case
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
- Fixed-slope universal lossy data compression
Cites work
- A coding theorem for lossy data compression by LDPC codes
- Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity
- An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
- Efficient erasure correcting codes
- Elements of Information Theory
- Error exponent for source coding with a fidelity criterion
- Fixed-Length Lossy Compression in the Finite Blocklength Regime
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 3318548 (Why is no real title available?)
- Linear-time encodable and decodable error-correcting codes
- Lossy Compression of Discrete Sources via the Viterbi Algorithm
- Nonlinear Sparse-Graph Codes for Lossy Compression
- On the role of pattern matching in information theory
- Polar Codes are Optimal for Lossy Source Coding
- Probability Inequalities for Sums of Bounded Random Variables
- Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
- The redundancy of source coding with a fidelity criterion. 1. Known statistics
Cited in
(6)- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
- A theory of incremental compression
- An information-theoretic framework for the lossy compression of link streams
- Pointwise redundancy in lossy data compression and universal lossy data compression
- On the performance of recency-rank and block-sorting universal lossless data compression algorithms
- On the rate-distortion-perception-semantics tradeoff in low-rate regime for lossy compression
This page was built for publication: Achievable complexity-performance tradeoffs in lossy compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1945149)
