Improvements on some error-tolerance pooling designs

详细信息    查看全文

• 作者：Huilan Chang ; ^{huilan0102@gmail.com" class="auth_mail" title="E-mail the corresponding author} ; Yi-Tsz Tsai ^{gfedc0606@gmail.com" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Group testing ; Pooling design ; Error-tolerance ; Johnson graph
• 刊名：Discrete Applied Mathematics
• 出版年：2016
• 出版时间：19 February 2016
• 年：2016
• 卷：200
• 期：Complete
• 页码：18-22
• 全文大小：357 K

文摘

Pooling designs are fundamental tools in many applications such as biotechnology and network security. Many famous pooling designs have been constructed from mathematical structures by “containing relations”. Recently, pooling designs constructed by “intersecting relation” have been proposed by Guo and Wang (2011). Constructing by intersecting relation provides much better error-tolerance capabilities. We study the error-tolerance capabilities of pooling designs constructed by intersecting relation from combinatorial structures proposed by D’yachkov et al. (2007) and Lv et al. (2014).