CONSTRUCTION OF NONSYSTEMATIC LOW-DENSITY PARITY-CHECK CODES BASED ON SYMMETRIC BALANCED INCOMPLETE BLOCK DESIGN

This paper studies the nonsystematic Low-Density Parity-Check(LDPC)codes based onSymmetric Balanced Incomplete Block Design(SBIBD).First,it is concluded that the performancedegradation of nonsystematic linear block codes is bounded by the average row weight of generalizedinverses of their generator matrices and code rate.Then a class of nonsystematic LDPC codes con-structed based on SBIBD is presented.Their characteristics include:both generator matrices andparity-check matrices are sparse and cyclic,which are simple to encode and decode;and almost arbi-trary rate codes can be easily constructed,so they are rate-compatible codes.Because there aresparse generalized inverses of generator matrices,the performance of the proposed codes is only0.15dB away from that of the traditional systematic LDPC codes.

Splitting Balanced Incomplete Block Designs with Block Size 2×k

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.

On the Existence of (v,3×3,λ)-Splitting Balanced Incomplete Block Design with λ between 2 to 9

Let （v, u × c,λ）-splitting BIBD denote a （v, u × c,λ）-splitting balanced incomplete block design of order v with block size u × c and index A. The necessary conditions for the existence of a （v, u × c,λ）-splitting BIBD are v ≥ uc, λ（v- 1） -- 0 0 mod （c（u- 1）） and Av（v- 1） - 0 mod （c^2u（u- 1））. In this paper, for 2 ≤λ≤ 9 the necessary conditions for the existence of a （v, 3 × 3, λ）-splitting BIBD are also sufficient with one possible exception for （v, λ） = （39, 9）.

General Solution of Normal Equations in the Intra-Block Analysis of PBIB Designs with Four Associates

General solution of normal equations in the general intra-block analysis of partially balanced incomplete block designs involving four associates is presented in this talk as they are quite useful in practice. Only intra-block estimates are given as the necessary formulae for inter-block estimates can be derived from them by changing the parameters as discussed in Rao[5]. We have obtained the general formulae for computation of four types of efficiencies, the average efficiency factor and the variance of the estimated elementary treatment contrast of the four types of comparisons irrespective of the type of association scheme a PBIB Design follows.

Some Construction Methods of Optimum Chemical Balance Weighing Designs III

Methods of constructing the optimum chemical balance weighing designs from symmetric balanced incomplete block designs are proposed with illustration. As a by-product pairwise efficiency and variance balanced designs are also obtained.

A collision recovery algorithm using optimal Q parameter based on BIBD in RFID

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.

A topology-transparent MAC scheduling algorithm with guaranteed QoS for multihop wireless network

Due to its character of topology independency, topology-transparent medium access control (MAC) scheduling algorithm is very suitable for large-scale mobile ad hoc wireless networks. In this paper, we propose a new topologytransparent MAC scheduling algorithm, with parameters of the node number and the maximal nodal degree known, our scheduling algorithm is based on a special balanced incomplete block design whose block size is optimized by maximizing the guaranteed throughput. Its superiority over typical other scheduling algorithms is proven mathematically with respect to the guaranteed throughput, the maximal transmission delay, and also the minimal transmission delay. The effect of inaccuracy in the estimation of the maximal nodal degree on the guaranteed throughput is deduced mathematically, showing that the guaranteed throughput decreases almost linearly as the actual nodal degree increases. Further techniques for improving the feasibility of the algorithm, such as collision avoidance, time synchronization, etc., are also discussed.

The Existence of BIB Designs

Given any positive integers k3 and λ,let c（k,λ）denote the smallest integer such that u ∈ B（k,λ）for every integer uc（k,λ）that satisfies the congruences λv（v-1）≡0（mod k（k-1））and λ（u-1）≡0（mod k-1）.In this article we make an improvement on the bound of c（k,λ）provided by Chang in[4]and prove that c（k,λ）exp{k3k6}.In particular,c（k,1）exp{kk2}.