Strong universal source coding subject to a rate-distortion constraint
From MaRDI portal
Recommendations
Cited in
(28)- The strong converse for source coding with a fidelity criterion
- Typicality of good rate-distortion code
- On the divisibility of discrete sources with an additive single-letter distortion measure
- Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff
- Output Constrained Lossy Source Coding With Limited Common Randomness
- scientific article; zbMATH DE number 4174823 (Why is no real title available?)
- scientific article; zbMATH DE number 3847300 (Why is no real title available?)
- Source coding bounds using quantizer reproduction levels (Corresp.)
- scientific article; zbMATH DE number 3863088 (Why is no real title available?)
- A class of distortionless codes designed by Bayes decision theory
- scientific article; zbMATH DE number 5010756 (Why is no real title available?)
- Joint Fixed-Rate Universal Lossy Coding and Identification of Continuous-AlphabetMemoryless Sources
- Robust source coding of weakly compact classes
- Distortion-rate theory for individual sequences
- Universal codes for a class of composite sources (Corresp.)
- A rate of convergence result for a universal D-semifaithful code
- There is no universal source code for an infinite source alphabet
- Bounds on achievable convergence rates of parameter estimators via universal coding
- scientific article; zbMATH DE number 738888 (Why is no real title available?)
- Simplistic universal coding
- Distortion-rate bounds for fixed- and variable-rate multiresolution source codes
- Arbitrary source models and Bayesian codebooks in rate-distortion theory
- Universal noiseless coding
- Fixed-rate universal lossy source coding and rates of convergence for memoryless sources
- A strong version of the redundancy-capacity theorem of universal coding
- THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
- Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions
- Universal coding for discrete memoryless sources uniform with respect to output
This page was built for publication: Strong universal source coding subject to a rate-distortion constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3966043)