Multiple description coding of discrete ergodic sources

Authors:
Shirin Jalali;Tsachy Weissman
Affiliations:
Center for the Mathematics of Information, California Institute of Technology, Pasadena, CA;Department of Electrical Engineering, Stanford University, Stanford, CA
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 5
Cited 0

New results in binary multiple descriptions

IEEE Transactions on Information Theory
Multiple Description Coding for Stationary and Ergodic Sources

DCC '07 Proceedings of the 2007 Data Compression Conference
Consolidating achievable regions of multiple descriptions

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Multiple description coding with many channels

IEEE Transactions on Information Theory
An Algorithm for Universal Lossless Compression With Side Information

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of Multiple Description (MD) coding of discrete ergodic processes. We introducef 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.