DOI: 10.1109/itcom.1999.781409
View full text
|
Sign up to set email alerts
|
Share

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.