Reliability in Source Coding With Side Information
From MaRDI portal
Abstract: We study error exponents for source coding with side information. Both achievable exponents and converse bounds are obtained for the following two cases: lossless source coding with coded information (SCCSI) and lossy source coding with full side information (Wyner-Ziv). These results recover and extend several existing results on source-coding error exponents and are tight in some circumstances. Our bounds have a natural interpretation as a two-player game between nature and the code designer, with nature seeking to minimize the exponent and the code designer seeking to maximize it. In the Wyner-Ziv problem our analysis exposes a tension in the choice of test channel with the optimal test channel balancing two competing error events. The Gaussian and binary-erasure cases are examined in detail.
Recommendations
- On source coding with side-information-dependent distortion measures
- The reliability functions of the general source with fixed-length coding
- Constrained Source-Coding With Side Information
- Cyclic Division Algebras: A Tool for Space-Time Coding
- Source Coding Problems With Conditionally Less Noisy Side Information
- Zero-Error Source–Channel Coding With Side Information
- On zero-error source coding with decoder side information
- Side-Information Scalable Source Coding
- On Lossy Source Coding With Side Information Under the Erasure Distortion Measure
- On source coding with side information via a multiple-access channel and related problems in multi-user information theory
Cited in
(2)
This page was built for publication: Reliability in Source Coding With Side Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989820)
