A New Method of Construction of Robust Second Order Rotatable Designs Using Balanced Incomplete Block Designs

The following article has been retracted due to the investigation of complaints received against it. Title: A New Method of Construction of Robust Second Order Rotatable Designs Using Balanced Incomplete Block Designs Authors: Bejjam Re. Victorbabu, Kottapalli Rajyalakshmi. The above paper is a copy of Dr. Rabindra Nath Das’s former article, entitled '“Robust second order rotatable designs (Part I)”. The scientific community takes a very strong view on this matter and we solemnly withdrawn?the paper from the journal OJS. This paper published in OJS Vol.2 No.1, 39-47, 2012, has been retracted.

U-Type Designs via New Generalized Partially Balanced Incomplete Block Designs with <i>m</i>= 4, 5 and 7 Associated Classes

The traditional combinatorial designs can be used as basic designs for constructing designs of computer experiments which have been used successfully till now in various domains such as engineering, pharmaceutical industry, etc. In this paper, a new series of generalized partially balanced incomplete blocks PBIB designs with m associated classes (m = 4, 5 and 7) based on new generalized association schemes with number of treatments v arranged in w arrays of n rows and l columns (w ≥ 2, n ≥ 2, l ≥ 2) is defined. Some construction methods of these new PBIB are given and their parameters are specified using the Combinatory Method (s). For n or l even and s divisor of n or l, the obtained PBIB designs are resolvable PBIB designs. So the Fang RBIBD method is applied to obtain a series of particular U-type designs U (wnl;) (r is the repetition number of each treatment in our resolvable PBIB design).

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.

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.

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.

基于RBIBD的最优局部修复码构造

随着数据量的迅速增长,对存储海量数据的分布式存储系统的可靠性和有效性的要求日益增加。局部修复码(LRCs)具有良好的修复局部性,能够有效实现海量数据在分布式存储系统中的可靠高效存储,构造具有(r,t)局部性的局部修复码已经成为当前研究的热点。为此,提出了一种基于可分解均衡不完全区组设计(RBIBD)的最优局部修复码的构造方法,构造信息位具有(r,t)局部性的二元最优单校验LRCs。性能分析表明,构造的LRCs达到了最小距离最优边界,且在码率上表现得更优。

The Construction of Pairwise Additive Minimal BIB Designs with Asymptotic Results

An asymptotic existence of balanced incomplete block (BIB) designs and pairwise balanced designs (PBD) has been discussed in [1]-[3]. On the other hand, the existence of additive BIB designs and pairwise additive BIB designs with k = 2?and?λ = 1?has been discussed with direct and recursive constructions in [4]-[8]. In this paper, an asymptotic existence of pairwise additive BIB designs is proved by use of Wilson’s theorem on PBD, and?also for some l?and k the exact existence of l?pairwise additive BIB designs with block size k and?λ = 1?is discussed.

Some Construction Methods of A-Optimum Chemical Balance Weighing Designs

Some new construction methods of the optimum chemical balance weighing designs and pairwise efficiency and variance balanced designs are proposed, which are based on the incidence matrices of the known symmetric balanced incomplete block designs. Also the conditions under which the constructed chemical balance weighing designs become A-optimal are also been given.

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）.

Some Properties of Weak Block Designs

The necessary conditions for the existence of weak designs are given in the form of two inequalities in this paper. The relations among weak block designs (WBDs) , Balanced incomplete block designs ( BIBDs) and differential balanced block designs (DBBDs) are researched.

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.

基于阿贝尔群上的差分集构造LDPC码

本文给出了区组长度为3、4和5的平衡不完全区组设计,将设计的关联矩阵作为校验矩阵,从而构造出3种低密度奇偶校验码(LDPC,low-density parity-check code)。由于这些校验矩阵是准循环矩阵,所以构造的码是拟循环LDPC码(QC-LDPC,quasi-cyclic LDPC)。计算码的相关参数,并针对具体的例子通过与类随机码的译码性能进行分析比较,结果显示,所构造的码具有较好的性能。

一种基于BIBD的量子LDPC码构造新方法

利用均衡不完全区组设计(Balance Imcomplete Block Designs,BIBD)的半结构化低密度奇偶校验(LowDensity Parity Check,LDPC)码设计方法,该文提出了一种获得自对偶CSS(Calderbank-Shor-Steane)式的量子LDPC码的校验矩阵的新构造方法。由于构造出的量子码校验矩阵稀疏,有且仅有一个4环(girth 4),在置信传播迭代译码算法下可获得良好的性能。数值计算结果表明,对于该构造方法得到的GF(6t+1)和GF(12t+1)量子LDPC码,比基于BIBD的其他构造方法所得到的量子码的码长更长、量子校验矩阵更加稀疏、性能也更加优越。

基于BIBD和循环置换矩阵的LDPC码

提出一种基于平衡不完全区组设计(BIBD)和循环置换矩阵的准循环低密度校验码(LDPC)构造方法。根据实际需求,利用BIBD构造相应的模板矩阵,用适合的循环置换矩阵进行扩展。采用该方法构造的LDPC码具有良好的结构和灵活性,该方法在一定范围内可快速方便构造出某一特定码长或码率的准循环LDPC码。仿真结果证明,准循环LDPC码在高斯白噪声信道上采用迭代译码时,具有较优的纠错性能及较低的错误平层。

基于BIB-LCJ法与SD法的杜鹃专类园春季植物景观美学评价

杜鹃(Rhododendron L.)专类园是春季景观最具特色的专类园之一,运用BIB-LCJ法(Balanced Incomplete Block design-Law of Comparative Judgment,平衡不完全区组设计-比较评判法)对湖南省森林植物园国家杜鹃园25个景观样本进行了美学评价,根据200名评价者的评价结果,得出最优及最差景观样本;同时,40名相关领域人员采用SD法(Semantic Differential,语义学解析法)对以上样本也进行了评价。综合2种评价结果,认为最优景观样本为14、1、6、20号,最差样本为9、10、25、22号。对SD法评价结果进行SD分析和因子分析,得到影响杜鹃专类园春季植物景观的因子有环境、空间、形式、美感4个方面。

基于BIBD的多进制准循环LDPC码构造

随机多进制低密度奇偶校验码(low-density parity-check,LDPC)的编码相当复杂,而具有特定结构的准循环LDPC码具有线性复杂度编码的特点。提出基于均衡不完全区组设计(balanced incomplete block design,BIBD)的具有高性能且能有效编码的多进制准循环LDPC码代数构造方法,构造出的多进制校验矩阵非零值的位置和数值分别建立于2个不同的域。结合BIBD和新定义的多进制位置向量进行广义二维扩展生成素数大小的多进制准循环矩阵,由此构造出的3类多进制LDPC码girth均不小于6。仿真结果表明,采用FFTQSPA对构造的LDPC码进行译码,在AWGN信道下相比于同等比特长度同等码率的RS码来说可以取得明显的编码增益。

一种BIBD编码的RFID防碰撞算法的改进

如何解决多标签识别时的数据冲突是射频识别(RFID)系统中的一个关键问题。为了解决这个问题,在总结分析相关一些二进制防碰撞算法的基础上,提出一种基于平衡不完全区组设计(BIBD)编码的改进型防碰撞算法。相对于传统的防碰撞算法,它以BIBD编码为基础,并且引入标签的多状态机制,使得对标签的识读达到逐节识读和识读过程中数据的传输量大大减少的目的。理论分析和仿真实验表明该算法显著提高了RFID系统的识别效率,特别适合RFID系统在标签较多和标签ID过长的情况下应用。

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.

PBIB设计的约化

设是一个具有ｍ个结合类的ＰＢＩＢ设计，且它的多数λ＿１，λ＿２，．．．，λ＿ｍ中至少有两个是相等的。第二节中，给出了ＰＢＩＢ设计可以用遂次合并结合类来约化的充分必要条件。第三节给出了ＰＢＩＢ设计可以用同时合并结合类来约化的充分必要条件。最后，在第四节里我们研究了上述两种方法之间的关系。

BIB设计与抽样调查

平衡不完全区组设计是试验设计中较为常用的一种方法。本文利用 BIB 设计表来安排当总体含 N 个单位时的抽样方案,得到含量为 n 的样本形成的较小的集合。