TY - JOUR
T1 - The redundancy of successive refinement codes and codes with side information
AU - Voronov, G.
AU - Feder, M.
PY - 2000
Y1 - 2000
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0034450068&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:0034450068
SN - 2157-8095
SP - 126
JO - IEEE International Symposium on Information Theory - Proceedings
JF - IEEE International Symposium on Information Theory - Proceedings
T2 - 2000 IEEE International Symposium on Information Theory
Y2 - 25 June 2000 through 30 June 2000
ER -