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

While lattice vector quantization (LVQ) can solve the complexity problem of LBG based vector quantizers, and also yield very general codebooks, a single stage lattice VQ, when applied to high variance vectors result in very large and unwieldy indices, making it unsuitable for applications requiring successive refinement. The goal of this work is to develop a unified framework for progressive un...

Lossy coding problems are investigated for some communication systems in the presense of cascading and/or feedback information channels from decoders so as to refine reproduction messages. This framework provides different types of refinement structures from so-called successive refinement. Three different types of communication systems are considered, i.e. refinement systems in the presense of...