On symmetric multiple description coding

We derive a single-letter lower bound on the minimum sum rate of multiple description coding with symmetric distortion constraints. For the binary uniform source with the Hamming distortion measure, this lower bound can be evaluated with the aid of a certain minimax theorem. A similar minimax theore...

Full description

Saved in:
Bibliographic Details
Published in:2013 IEEE Information Theory Workshop (ITW) pp. 1 - 5
Main Authors: Lin Song, Shuo Shao, Jun Chen
Format: Conference Proceeding
Language:English
Published: IEEE 01.09.2013
Subjects:
Distortion measurement
Encoding
Joints
Markov processes
Tin
Vectors
Zinc
ISBN:9781479913213, 1479913219
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We derive a single-letter lower bound on the minimum sum rate of multiple description coding with symmetric distortion constraints. For the binary uniform source with the Hamming distortion measure, this lower bound can be evaluated with the aid of a certain minimax theorem. A similar minimax theorem is established in the quadratic Gaussian setting, which is further leveraged to analyze the special case where the minimum sum rate subject to two levels of distortion constraints (with the second level imposed on the complete set of descriptions) is attained; in particular, we determine the minimum achievable distortions at the intermediate levels.
ISBN:9781479913213
1479913219
DOI:10.1109/ITW.2013.6691217