Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 22, 2010 | Published
Book Section - Chapter Open

Multiple Description Coding of Discrete Ergodic Sources

Abstract

We investigate the problem of Multiple Description (MD) coding of discrete ergodic processes. We introduce the notion of MD stationary coding, and characterize its relationship to the conventional block MD coding. In stationary coding, in addition to the two rate constraints normally considered in the MD problem, we consider another rate constraint which reflects the conditional entropy of the process generated by the third decoder given the reconstructions of the two other decoders. The relationship that we establish between stationary and block MD coding enables us to devise a universal algorithm for MD coding of discrete ergodic sources, based on simulated annealing ideas that were recently proven useful for the standard rate distortion problem.

Additional Information

© 2009 IEEE. We thank Jun Chen for suggesting the current proof of Theorem 1, in lieu of our original proof which was more complicated.

Attached Files

Published - Jalali2009p109252009_47Th_Annual_Allerton_Conference_On_Communication_Control_And_Computing_Vols_1_And_2.pdf

Files

Jalali2009p109252009_47Th_Annual_Allerton_Conference_On_Communication_Control_And_Computing_Vols_1_And_2.pdf

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023