Paper Info
Title
Successive Refinement on Trees: A Special Case of a New MD Coding Region
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.
Year
DOI
Venue
2001
10.1109/DCC.2001.917160
Data Compression Conference
Keywords
Field
DocType
recent achievability result,general problem,new achievability result,memoryless gaussian source,multiple description,successive refinability,successive refinement,special case,new md coding region,l-stage successive refinement problem,computer aided software engineering,chains,information theory,noise measurement,rate distortion theory,source coding,broadcasting,multiple description coding,strontium,noise figure
Discrete mathematics,Combinatorics,Successive refinement,Source code,Coding region,Coding (social sciences),Theoretical computer science,Gaussian,Multiple description,Rate–distortion theory,Mathematics,Special case
Conference
ISSN
Citations 
PageRank 
1068-0314
8
1.28
References 
Authors
5
3
Name
Order
Citations
PageRank
Raman Venkataramani1319.58
Gerhard Kramer244534.21
Vivek K. Goyal32031171.16