Arbitrary source models and Bayesian codebooks in rate-distortion theory
From MaRDI portal
Recommendations
- Pointwise redundancy in lossy data compression and universal lossy data compression
- The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics
- Strong universal source coding subject to a rate-distortion constraint
- An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
- scientific article; zbMATH DE number 763790
Cited in
(15)- Large deviations for template matching between point processes
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
- A class of distortionless codes designed by Bayes decision theory
- The Empirical Distribution of Rate-Constrained Source Codes
- The Generalized Asymptotic Equipartition Property: Necessary and Sufficient Conditions
- Joint Fixed-Rate Universal Lossy Coding and Identification of Continuous-AlphabetMemoryless Sources
- Combinatorial properties of good codes for binary autoregressive sources (Corresp.)
- On the role of mismatch in rate distortion theory
- Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding
- Minimax optimal Bayes mixtures for memoryless sources over large alphabets
- An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models
- On the minimum distortion of block codes for a binary symmetric source (Corresp.)
- scientific article; zbMATH DE number 2226639 (Why is no real title available?)
- Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
- Lossy Compression of General Random Variables
This page was built for publication: Arbitrary source models and Bayesian codebooks in rate-distortion theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677548)
