Enumerative coding for k-ary trees

摘要

We propose an efficient code for k-ary trees and give the encodingand decoding algorithms based on enumeration. The code has betterperformance than the commonly used pre-order coding for k-ary trees whenk is larger than two, and is asymptotically tight in the sense that thecoefficient of the linear term of length function of codewords for treesis the best possible