Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)
DOI: 10.1109/itcom.1999.781409
| View full text |Cite
Sign up to set email alerts

Abstract: In this work we analyze redundancy, as a function of the block length of successive refinement codes. It turns out that an extra rate of O(logn/2n) must be paid for each stage of code.

Help me understand this report

This publication either has no citations yet, or we are still processing them

Set email alert for when this publication receives citations?

See others like this or search for similar articles