Reliability in Source Coding With Side Information

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 and lossy source coding with full side information (Wyner-Ziv). These results recover and extend sev...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 58; no. 8; pp. 5086 - 5111
Main Authors: Kelly, B. G., Wagner, A. B.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.08.2012
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Applied sciences
Channels
Coding
Coding theory
Coding, codes
Decoding
Entropy
Error analysis
Error exponents
Exact sciences and technology
Exponents
Games
Gaussian
Information theory
Information, signal and communications theory
Joints
Lossless
Mathematical analysis
Mathematical problems
Normal distribution
Optimization
Optimization techniques
Random variables
Relays
side information
Signal and communications theory
Source coding
Telecommunications and information theory
test channel optimization
Wyner-Ziv problem
test channel optimization
Lossless circuit
Source coding
Coding errors
side information
Lossy medium
Optimal test
Optimization
Information source
Error exponents
Wyner-Ziv problem
Wyner Ziv problem
Reliability
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2012.2201346