A class of error-correcting pooling designs over complexes | Journal of Combinatorial Optimization Skip to main content
Log in

A class of error-correcting pooling designs over complexes

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

As a generalization of d e-disjunct matrices and (w,r;d)-cover-free-families, the notion of (s,l)e-disjunct matrices is introduced for error-correcting pooling designs over complexes (or set pooling designs). We show that (w,r,d)-cover-free-families form a class of (s,l)e-disjunct matrices. Moreover, a decoding algorithm for pooling designs based on (s,l)e-disjunct matrices is considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Similar content being viewed by others

References

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kaishun Wang.

Additional information

This paper was presented in Algebraic Combinatorics-an international conference, held in Sendai, June 2006, in honor the 60th Birthday of Professor E. Bannai.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, T., Wang, K. & Weng, CW. A class of error-correcting pooling designs over complexes. J Comb Optim 19, 486–491 (2010). https://doi.org/10.1007/s10878-008-9179-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-008-9179-4

Keywords

Navigation