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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2013 IEEE Information Theory Workshop (ITW) s. 1 - 5
Hlavní autoři: Lin Song, Shuo Shao, Jun Chen
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.09.2013
Témata:
Distortion measurement
Encoding
Joints
Markov processes
Tin
Vectors
Zinc
ISBN:9781479913213, 1479913219
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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