J4 ›› 2014, Vol. 41 ›› Issue (6): 148-154.doi: 10.3969/j.issn.1001-2400.2014.06.025

• Original Articles • Previous Articles     Next Articles

Dimensions estimating and the dimension-reducing algorithms for the adaptive multi-dimension division code

LI Zhijin1;ZHOU Jie1;QIAO Jie1;WU Wenjuan2   

  1. (1. College of Electronic & Information Engineering, Nanjing University of Information Science & Technology, Nanjing  210044, China;
    2. College of Science,Nanjing Forestry University, Nanjing  210017, China)
  • Received:2013-05-11 Online:2014-12-20 Published:2015-01-19
  • Contact: LI Zhijin E-mail:lizhijin@nuist.edu.cn

Abstract:

When the dimension-weight(Q) equals the 4, Multi-Dimension Division Code algorithm is optimal. In this paper, we give the proof according to the principle of the Adaptive Multi-Dimension Division Code. The more the tags, the more the dimensions of the Multi-Dimension Division Code, and so we give the methods for tags estimation and dimensions estimation. Moreover, the algorithm for tags encoding after dimension-reduction is given, and the algorithm for tags decoding is given too. The Adaptive Multi-Dimension Division Code algorithm can significantly improve the efficiency of searching for tags whether in many collisions or few collisions.

Key words: adaptive multi-dimension division code, dimensions estimating, dimension-reducing algorithms, de-code algorithms

CLC Number: 

  • TN92