By Topic

Sequencing multiple descriptions

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
$33 $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)
J. Barros ; Inst. for Commun. Eng., Munich Univ. of Technol., Munchen, Germany ; S. D. Servetto

Summary from only given as follows. In its original formulation, multiple description (MD) coding is a multiuser lossy source coding problem, in which three decoders get to observe encodings of a single source generated by two senders. In general, the rate delivered to each of the decoders is not the same and, based on this, it has been argued that MD codes would be suitable for use as joint source/channel codes in a standard point-to-point problem: low-rate decoders would be used when there is loss of data, and high-rate decoders would be used when more data is available at the receiver. We present an alternative view on the use of MD codes as joint source/channel codes. We show how a channel naturally associated with the standard joint source/channel coding problem based on MDs is a non-ergodic channel that bears little resemblance to packet channels (i.e., those for which MD codes have been proposed in practice) and we propose a simple modification to the MD setup that deals with this. We also consider the problem of designing suitable codes and we show how the associated decoding problem is essentially equivalent to the problem of sequencing DNA strands. The full paper is available from,

Published in:

Data Compression Conference, 2002. Proceedings. DCC 2002

Date of Conference: