Abstract
Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorithm used to optimize such quantizers. A proof that the result holds for a general class of distributions is sketched.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 3-12 |
| Number of pages | 10 |
| Journal | Data Compression Conference Proceedings |
| State | Published - Jan 1 2001 |
| Event | Data Compression Conference - Snowbird, UT, United States Duration: Mar 27 2001 → Mar 29 2001 |
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
Fingerprint
Dive into the research topics of 'On Zador's entropy-constrained quantization theorem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver