Note on islands in path-length sequences of binary trees

Authors S. Cortes Reina, Stephan Foldes, Y. Mardoukhi, N. M. Singhi

Publication date 12 September 2014

Trees (05C05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15)

Abstract: An earlier characterization of topologically ordered (lexicographic) path-length sequences of binary trees is reformulated in terms of an integrality condition on a scaled Kraft sum of certain subsequences (full segments, or islands). The scaled Kraft sum is seen to count the set of ancestors at a certain level of a set of topologically consecutive leaves is a binary tree.

This page was built for publication: Note on islands in path-length sequences of binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6254613)