Chou, P. A. and Effros, M. and Gray, R. M. (1995) Universal quantization of parametric sources has redundancy k/2 (log n)/n. In: IEEE International Symposium on Information Theory (ISIT '95), Whistler, British Columbia, Canada, 1722 September 1995. IEEE , Piscataway, NJ, p. 371. ISBN 0780324544 http://resolver.caltech.edu/CaltechAUTHORS:CHOisit95

PDF
See Usage Policy. 127Kb 
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:CHOisit95
Abstract
Rissanen has shown that there exist universal noiseless codes for {Xi} with perletter rate redundancy as low as k/2 (log n)/n, where n is the blocklength and k is the number of source parameters. We derive an analogous result for universal quantization: for any given Lagrange multiplier λ>0, there exist universal fixedrate and variablerate quantizers with perletter Lagrangian redundancy (i.e., distortion redundancy plus λ times the rate redundancy) as low as λk/2 (log n)/n.
Item Type:  Book Section 

Additional Information:  © Copyright 1995 IEEE. Reprinted with permission. 
Subject Keywords:  source coding theory; universal source coding 
Record Number:  CaltechAUTHORS:CHOisit95 
Persistent URL:  http://resolver.caltech.edu/CaltechAUTHORS:CHOisit95 
Alternative URL:  http://dx.doi.org/10.1109/ISIT.1995.550358 
Usage Policy:  No commercial reproduction, distribution, display or performance rights in this work are provided. 
ID Code:  7331 
Collection:  CaltechAUTHORS 
Deposited By:  Archive Administrator 
Deposited On:  31 Jan 2007 
Last Modified:  26 Dec 2012 09:31 
Repository Staff Only: item control page