Successive Refinement on Trees: A Special Case of a New MD Coding Region

Authors:
Raman Venkataramani;Gerhard Kramer;Vivek K. Goyal
Affiliations:
-;-;-
Venue:
DCC '01 Proceedings of the Data Compression Conference
Year:
2001

Citing 1
Cited 1

New results in binary multiple descriptions

IEEE Transactions on Information Theory

Tree-Structured Multiple Description Coding

Journal of VLSI Signal Processing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: New achievability results for the L-stage successive refinement problem with L 2 are presented. These are derived from a recent achievability result for the more general problem of multiple description coding with L 2 channels. It is shown that successive refinability on chains implies successive refinability on trees and that memoryless Gaussian sources are successively refinable on chains and trees.