In this work,an optimal Q algorithm based on a collision recovery scheme is presented. Tags use BIBD-( 16,4,1) codes instead of RN16 s. Therefore,readers can make a valid recognition even in collision slots. A way of ...In this work,an optimal Q algorithm based on a collision recovery scheme is presented. Tags use BIBD-( 16,4,1) codes instead of RN16 s. Therefore,readers can make a valid recognition even in collision slots. A way of getting the optimal slot-count parameter is studied and an optimal Q algorithm is proposed. The theoretical and simulation results show that the proposed algorithm can improve reading efficiency by 100% more than the conventional Q algorithm. Moreover,the proposed scheme changes little to the existing standard. Thus,it is easy to implement and compatible with ISO 18000-6C.展开更多
The existence of several non-symmetric balanced incomplete block designs (BIBDs) is still unknown. This is because the non-existence property for non-symmetric BIBDs is still not known and also the existing constructi...The existence of several non-symmetric balanced incomplete block designs (BIBDs) is still unknown. This is because the non-existence property for non-symmetric BIBDs is still not known and also the existing construction methods have not been able to construct these designs despite their design parameters satisfying the necessary conditions for the existence of BIBD. The study aimed to bridge this gap by introducing a new class of non-symmetric BIBDs. The proposed class of BIBDs is constructed through the combination of disjoint symmetric BIBDs. The study was able to determine that the total number of disjoint symmetric BIBDs (n) with parameters (v = b, r = k, λ) that can be obtained from an un-reduced BIBD with parameters (v, k) is given by n = r - λ. When the n symmetric disjoint BIBDs are combined, then a new class of symmetric BIBDs is formed with parameters v<sup>*</sup><sup> </sup>= v, b<sup>*</sup><sup> </sup>= nb, r<sup>*</sup><sup> </sup>= nr, k<sup>*</sup><sup> </sup>= k, λ<sup>*</sup><sup> </sup>= λ, where 2≤ n ≤ r - λ. The study established that the non-existence property of this class of BIBD was that when is not a perfect square then v should be even and when v<sup>*</sup><sup> </sup>is odd then the equation should not have a solution in integers x, y, z which are not all simultaneously zero. In conclusion, the study showed that this construction technique can be used to construct some non-symmetric BIBDs. However, one must first construct the disjoint symmetric BIBDs before one can construct the non-symmetric BIBD. Thus, the disjoint symmetric BIBDs must exist first before the non-symmetric BIBDs exist.展开更多
Let k be any integer and k≥3. In this article it is proved that the necessary condition υ=k (mod k(k-1)) for the existence of an RB(v,k,1) is sufficient whenever u>exp{exp{k12k2}}.
This paper investigated the existence of splitting balanced incomplete block designs with blck size 2× k .The necessary conditions for such a design are λ(v-1) ≡0(mod k ),and λv(v- 1)≡0(mod 2 k 2).It will sho...This paper investigated the existence of splitting balanced incomplete block designs with blck size 2× k .The necessary conditions for such a design are λ(v-1) ≡0(mod k ),and λv(v- 1)≡0(mod 2 k 2).It will show that the above necessary conditions are also sufficient for k =3 with the definite exception( v,λ )=(10,1) and with several possible exceptions.展开更多
基金Supported by the National Natural Science Foundation of China(No.61340005)Beijing Natural Science Foundation(No.4132012)+2 种基金Beijing Education Committee Science and Technology Development Plan(No.KM201411232011)Beijing Outstanding Personnel Training Project(No.2013D005007000006)Scientific Research Improving Project-Intelligent Sense and Information Processing(No.5211524100)
文摘In this work,an optimal Q algorithm based on a collision recovery scheme is presented. Tags use BIBD-( 16,4,1) codes instead of RN16 s. Therefore,readers can make a valid recognition even in collision slots. A way of getting the optimal slot-count parameter is studied and an optimal Q algorithm is proposed. The theoretical and simulation results show that the proposed algorithm can improve reading efficiency by 100% more than the conventional Q algorithm. Moreover,the proposed scheme changes little to the existing standard. Thus,it is easy to implement and compatible with ISO 18000-6C.
文摘The existence of several non-symmetric balanced incomplete block designs (BIBDs) is still unknown. This is because the non-existence property for non-symmetric BIBDs is still not known and also the existing construction methods have not been able to construct these designs despite their design parameters satisfying the necessary conditions for the existence of BIBD. The study aimed to bridge this gap by introducing a new class of non-symmetric BIBDs. The proposed class of BIBDs is constructed through the combination of disjoint symmetric BIBDs. The study was able to determine that the total number of disjoint symmetric BIBDs (n) with parameters (v = b, r = k, λ) that can be obtained from an un-reduced BIBD with parameters (v, k) is given by n = r - λ. When the n symmetric disjoint BIBDs are combined, then a new class of symmetric BIBDs is formed with parameters v<sup>*</sup><sup> </sup>= v, b<sup>*</sup><sup> </sup>= nb, r<sup>*</sup><sup> </sup>= nr, k<sup>*</sup><sup> </sup>= k, λ<sup>*</sup><sup> </sup>= λ, where 2≤ n ≤ r - λ. The study established that the non-existence property of this class of BIBD was that when is not a perfect square then v should be even and when v<sup>*</sup><sup> </sup>is odd then the equation should not have a solution in integers x, y, z which are not all simultaneously zero. In conclusion, the study showed that this construction technique can be used to construct some non-symmetric BIBDs. However, one must first construct the disjoint symmetric BIBDs before one can construct the non-symmetric BIBD. Thus, the disjoint symmetric BIBDs must exist first before the non-symmetric BIBDs exist.
基金the National Natural Science Foundation of China (No.19701002) HuoYingdong Foundation.
文摘Let k be any integer and k≥3. In this article it is proved that the necessary condition υ=k (mod k(k-1)) for the existence of an RB(v,k,1) is sufficient whenever u>exp{exp{k12k2}}.
基金National Natural Science Foundation ofChina(No.10 4710 93)
文摘This paper investigated the existence of splitting balanced incomplete block designs with blck size 2× k .The necessary conditions for such a design are λ(v-1) ≡0(mod k ),and λv(v- 1)≡0(mod 2 k 2).It will show that the above necessary conditions are also sufficient for k =3 with the definite exception( v,λ )=(10,1) and with several possible exceptions.
