Abstract
If a random codebook for lossy source coding is generated by a non-optimum reproduction distribution Q, then the entropy of the index of the D-matching codeword is reduced by conditioning on the codebook: the number of bits saved is equal to the divergence between the "favorite type" in the codebook and the generating distribution Q.
| Original language | English |
|---|---|
| Pages (from-to) | 124 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2000 |
| Event | 2000 IEEE International Symposium on Information Theory - Serrento, Italy Duration: 25 Jun 2000 → 30 Jun 2000 |
Fingerprint
Dive into the research topics of 'The index entropy in mismatched lossy source coding'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver