Abstract
In this work we consider the problem of determining the redundancy of successive refinement codes and codes with side information, as a function of their blocklength. It is shown that successive refinement codes accumulate an O(log n/2n) redundancy term at each stage of the encoding process, which may result in a considerable degradation of the final description. Redundancy result for codes with side information is also presented.
| Original language | English |
|---|---|
| Pages (from-to) | 126 |
| 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 redundancy of successive refinement codes and codes with side information'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver