On the redundancy of lossy source coding with abstract alphabets
From MaRDI portal
Recommendations
- On the redundancy of universal lossless coding for general piecewise stationary sources
- A large deviation theory proof of the abstract alphabet source coding theorem
- On the redundancy of trellis lossy source coding
- On the Asymptotic Redundancy of Lossless Block Coding With Two Codeword Lengths
- Bounds on the redundancy of binary alphabetical codes
- Optimal source coding for a class of integer alphabets (Corresp.)
- scientific article; zbMATH DE number 5010756
- scientific article; zbMATH DE number 3174001
- On the redundancy of optimal codes with limited word length
- Relative-redundancy universal coding of memoryless sources
Cited in
(8)- On the redundancy of universal lossless coding for general piecewise stationary sources
- Large deviations for template matching between point processes
- Stochastic sub-additivity approach to the conditional large deviation principle
- On the Asymptotic Redundancy of Lossless Block Coding With Two Codeword Lengths
- The redundancy of source coding with a fidelity criterion. 1. Known statistics
- 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
- Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
This page was built for publication: On the redundancy of lossy source coding with abstract alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701363)