Universal Coding for Lossless and Lossy Complementary Delivery Problems

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

20 pages, one column, submitted to IEEE Transactions on Information Theory

Scientific paper

This paper deals with a coding problem called complementary delivery, where messages from two correlated sources are jointly encoded and each decoder reproduces one of two messages using the other message as the side information. Both lossless and lossy universal complementary delivery coding schemes are investigated. In the lossless case, it is demonstrated that a universal complementary delivery code can be constructed by only combining two Slepian-Wolf codes. Especially, it is shown that a universal lossless complementary delivery code, for which error probability is exponentially tight, can be constructed from two linear Slepian-Wolf codes. In the lossy case, a universal complementary delivery coding scheme based on Wyner-Ziv codes is proposed. While the proposed scheme cannot attain the optimal rate-distortion trade-off in general, the rate-loss is upper bounded by a universal constant under some mild conditions. The proposed schemes allows us to apply any Slepian-Wolf and Wyner-Ziv codes to complementary delivery coding.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Universal Coding for Lossless and Lossy Complementary Delivery Problems 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 Universal Coding for Lossless and Lossy Complementary Delivery Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal Coding for Lossless and Lossy Complementary Delivery Problems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-107886

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.