DocumentCode
314063
Title
Enumerative coding for k-ary trees
Author
Kobayashi, K. ; Morita, H. ; Hoshi, M.
Author_Institution
Dept. of Comput. Sci. & Inf. Math., Univ. of Electro-Commun., Tokyo, Japan
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
423
Abstract
We propose an efficient code for k-ary trees and give the encoding and decoding algorithms based on enumeration. The code has better performance than the commonly used pre-order coding for k-ary trees when k is larger than two, and is asymptotically tight in the sense that the coefficient of the linear term of length function of codewords for trees is the best possible
Keywords
decoding; encoding; trees (mathematics); codewords; decoding algorithms; efficient code; encoding; enumerative coding; k-ary trees; length function; linear term; performance; Binary trees; Computer science; Decoding; Encoding; Entropy; Information systems; Information theory; Mathematics;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613360
Filename
613360
Link To Document