一类基于完全图K2m上匹配的相交关系的池设计

J4 ›› 2012, Vol. 47 ›› Issue (12): 53-56.

韩娜^1,2,李慧娟^1,2,刁科凤^1*

HAN Na^1,2, LI Hui-juan^1,2, DIAO Ke-feng^1*

1. School of Science, Linyi University, Linyi 276005, Shandong, China;
2. School of Mathematical Sciences, Shandong Normal University, Jinan 250014, Shandong, China

摘要：

利用有限集合的子集间的相交关系,构造了一族基于完全图K2m上匹配的池设计,并证明了它具有较高的容错性。

关键词: 池设计;se-分离矩阵;容错性;匹配

Abstract:

A family of pooling designs based on intersection of matchings in the complete graph K2m is constructed, which has higher degree of error correction.

Key words: pooling design; se-disjunct matrix; error correction; matchings

韩娜1,2,李慧娟1,2,刁科凤1*. 一类基于完全图K2m上匹配的相交关系的池设计[J]. J4, 2012, 47(12): 53-56.

HAN Na1,2, LI Hui-juan1,2, DIAO Ke-feng1*. Pooling designs based on intersection of matchings in the complete graph K2m[J]. J4, 2012, 47(12): 53-56.

Viewed

Full text

Abstract

Cited

Shared

Discussed

PDF (PC)