Two results about Matula numbers

被引：0
|
作者：
Burgos, Albert [1 ]
机构：
[1] Univ Murcia, E-30100 Murcia, Spain
来源：
DISCRETE MATHEMATICS | 2014年 / 323卷
关键词：
Matula numbers; Encoding scheme; Information entropy;
D O I：
10.1016/j.disc.2014.01.009
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In Matula (1968), D.W. Matula described a bijection between N and the set of rooted trees; the number is called the Matula number of the rooted tree. The Gutman-Ivic-Matula (GIM) function g(n) computes the number of edges of the tree with Matula number n. Since there is a prefix-free code for the set of prime numbers such that the codelength of each prime p is 2g(p), we show how some results about the GIM function can be obtained trivially from coding theorems. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：58 / 62
页数：5
相关论文
共 50 条
12345