Title :
Coding of ordered trees
Author :
Kobayashi, Kingo ; Morita, Hiroyoshi ; Hoshi, Nlainoru
Author_Institution :
Univ. of Electro-Commun., Tokyo, Japan
Abstract :
We study the asymptotic growth of ordered trees, and give important insights in coding of trees from the information theoretic viewpoint. Specifically, we give the optimal length function in a sense that the Kraft inequality is satisfied with equality. It is revealed that the commonly used pre-order coding for special classes of trees are asymptotically tight, but not always for many trees
Keywords :
source coding; tree codes; Catalan numbers; Kraft inequality; asymptotic growth; coding; equality; information theory; k-ary tree codes; optimal length function; ordered trees; pre-order coding; Entropy; Equations;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866305
