¹College of Computer Science and Technology, Symbol Computation and Knowledge Engineer of Ministry of Education, JiLin University, ChangChun, China
²College of Computer Science and Engineering, ChangChun University of Technology, ChangChun, China

---

Abstract—A novel planar IPPCT tree (PIPPCT) that holds higher data rate is presented based on analysis of main topologies characteristics of current dynamic graph watermarking system (DGW). Multiple dimensional IPPCT tree (MIPPCT) model and three identity vectors of DataRate uuuuuuuuuur , structure uuuuuuuuuur and Total uuuuur concerning it are constructed and presented, then the effect of these vectors on MIPPCT model is discussed in detail . The results proved that the data rate of MIPPCT tree will increase to a limit with its dimension number n increasing based on equal number of leaves and this limit is also computed. Moreover, it proved that there exists a two dimensional area HArea, when DataRate uuuuuuuuuur is in this area, dynamic graph watermarking system will take on greater performance.

Index Terms—software watermarking, dynamic graph, data rate, PIPPCT tree, DataRate uuuuuuuuuur , HArea

[PDF]

Cite: Zhu Jian-qi, Liu Yan-heng, Yin Ke-xin, "A Novel Planar IPPCT Tree Structure and Characteristics Analysis," Journal of Software vol. 5, no. 3, pp. 344-351, 2010.