Title :
Successive refinement on trees: a special case of a new MD coding region
Author :
Venkataramani, Raman ; Kramer, Gerhard ; Goyal, Vivek K.
Author_Institution :
Illinois Univ., Urbana, IL, USA
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 (MD) 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
Keywords :
rate distortion theory; source coding; trees (mathematics); L-stage successive refinement problem; achievability results; chains; memoryless Gaussian sources; multiple description coding; trees; Broadcasting; Computer aided software engineering; Information resources; Information theory; Noise figure; Noise measurement; Rate-distortion; Region 3; Strontium; USA Councils;
Conference_Titel :
Data Compression Conference, 2001. Proceedings. DCC 2001.
Conference_Location :
Snowbird, UT
Print_ISBN :
0-7695-1031-0
DOI :
10.1109/DCC.2001.917160
