Title :
The redundancy of successive refinement codes and codes with side information
Author :
Voronov, German ; Feder, Meir
Author_Institution :
Dept. of Electr. Eng.-Syst., Tel Aviv Univ., Israel
Abstract :
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(logn/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
Keywords :
codes; rate distortion theory; source coding; vector quantisation; TSVQ; average distortion; code blocklength; code redundancy; computational complexity; distortion-rate function; encoding; lossy source coding; side information; successive refinement codes; tree structured vector quantizer; Block codes; Computational complexity; Decoding; Degradation; Encoding; Performance analysis; Source coding; Tree data structures;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866418
