Reliability in Source Coding with Side Information

Details Reliability in Source Coding with Side Information Reliability in Source Coding with Side Information

2011-09-05

arxiv.org/abs/1109.0923v1

Computer Science

Information Theory

55 pages, 5 figures. Extended manuscript with all proofs. Shorter article submitted to IEEE Trans. Inf. Theory in September 20

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Reliability in Source Coding with Side Information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reliability in Source Coding with Side Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reliability in Source Coding with Side Information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-450196