DocumentCode :
2608145
Title :
On redundancy of coding using binary tree decomposition
Author :
Krivoulets, Alexandre
Author_Institution :
IT Univ. of Copenhagen, Denmark
fYear :
2002
fDate :
20-25 Oct. 2002
Firstpage :
200
Abstract :
We present an estimation of the redundancy of source coding using symbol binarization as a function of the decomposition tree and binary coding technique.
Keywords :
arithmetic codes; binary codes; binary sequences; redundancy; source coding; trees (mathematics); binary coding; binary sequence; binary tree decomposition; memoryless source; redundancy; source coding; symbol binarization; Adaptive coding; Arithmetic; Binary sequences; Binary trees; Entropy; Probability distribution; Source coding; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop, 2002. Proceedings of the 2002 IEEE
Print_ISBN :
0-7803-7629-3
Type :
conf
DOI :
10.1109/ITW.2002.1115456
Filename :
1115456
Link To Document :
بازگشت