By Topic

Binary erasure multiple descriptions: Worst-case distortion

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ahmed, Ebad ; Sch. of Electr. & Comput. Eng., Cornell Univ., Ithaca, NY, USA ; Wagner, A.B.

We consider a binary erasure version of the n-channel multiple descriptions problem with no excess rate and no distortion for every k out of n descriptions, i.e., any subset of k messages has a total rate of one and allows for perfect reconstruction of the source. Using a worst-case distortion criterion, we present an explicit coding scheme based on Reed-Solomon codes and, for any n and k, characterize its achievable distortion region when m < k messages are received at the decoder. We prove that this scheme is Pareto optimal in the achievable distortions for all n and k for any number of received messages at the decoder, and is optimal for all n and k when a single message is received. We also provide optimality results for a certain range of values of n and k.

Published in:

Information Theory, 2009. ISIT 2009. IEEE International Symposium on

Date of Conference:

June 28 2009-July 3 2009