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

• Articles • Previous Articles     Next Articles

Pooling designs based on intersection of matchings in the complete graph K2m

HAN Na1,2, LI Hui-juan1,2, DIAO Ke-feng1*   

  1. 1. School of Science, Linyi University, Linyi 276005, Shandong, China;
    2. School of Mathematical Sciences, Shandong Normal University, Jinan 250014, Shandong, China
  • Received:2012-04-13 Online:2012-12-20 Published:2012-12-14

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

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!