IJPAM: Volume 71, No. 1 (2011)


Elena Rubei
Dipartimento di Matematica ``U. Dini''
Viale Morgagni 67/A
50134 Firenze, ITALY

Abstract. We propose a code based on weighted trees and on the difficulty to reconstruct the weights of the tree from the distances $D_{i,j}$ among the leaves; precisely we consider an ordered rooted tree as code key; we put the letters of the message, translated into numbers, on the edges of the tree as their weights, by starting from the edges coming out from the root, then the edges coming out from the vertices of intrinsic distance $1$ from the root and so on. Then we forecast the numbers $D_{i,j}$ for $ i,j$ leaves of the tree.

Received: April 14, 2011

AMS Subject Classification: 05C05, 05C22, 94B25

Key Words and Phrases: weighted trees, codes

Download paper from here.

Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2011
Volume: 71
Issue: 1