A Caltech Library Service

Multi-resolution source coding theorems

Effros, Michelle (1998) Multi-resolution source coding theorems. In: IEEE International Symposium on Information Theory (ISIT '98), Cambridge, MA, 16-21 August 1998. IEEE , Piscataway, NJ, p. 226. ISBN 0-7803-5001-4.

See Usage Policy.


Use this Persistent URL to link to this item:


For stationary sources on Polish alphabets, we describe the family of achievable rate and distortion vectors (R1,…,RL) and (D1,…,DL) for an L-resolution source code, where the description at the first resolution is given at rate R1 and distortion D1, the description at the second resolution includes both the first description and a refining description of rate R2 and distortion D2, and so on. We consider performance bounds for fixed- and variable-rate source codes on discrete-time stationary ergodic and stationary nonergodic sources for any integer number of resolutions L ≥ 1. For L > 1, the results extend previous results for discrete memoryless sources.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© Copyright 1998 IEEE. Reprinted with permission. Supported in part by NSF CAREER Award MIP-9501977, a grant from the Powell Foundation, and donations from Intel.
Subject Keywords:discrete time systems; rate distortion theory; source coding; variable rate codes; source coding theory; network information theory
Record Number:CaltechAUTHORS:EFFisit98a
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:7335
Deposited By: Archive Administrator
Deposited On:01 Feb 2007
Last Modified:08 Nov 2021 20:41

Repository Staff Only: item control page