Pooling spaces and non-adaptive pooling designs

Discrete Mathematics

Volumn 282, Issue 1-3, 2004, Pages 163-169

  Huang, Tayuan ^a   Weng, Chih Wen ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Atomic interval; Pooling design; Pooling space; Ranked partially ordered set

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; SET THEORY; THEOREM PROVING;

ATOMIC INTERVALS; POOLING DESIGN; POOLING SPACE; RANKED PARTIALLY ORDERED SETS;

PROBLEM SOLVING;

EID: 2342628446     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2003.11.004     Document Type: Article

References (15)

1. P. Cameron, Projective and polar spaces, QMW Math. Notes, Vol. 13, University of London, London, 1992.
2. Delsarte P. Association schemes and. t -designs in regular semi-lattice J. Combin. Theory Ser. A. 20:1976;230-243.
3. e -disjunct inclusion matrices, preprint.
4. D'yachkov A.G., Rykov V. Superimposed distance codes. Probl. Control Inform. Theory. 18(4):1989;237-250.
5. Huang T. A characterization of the association schemes of bilinear forms. European J. Combin. 8:1987;159-173.
6. Kautz W.H., Singleton R.R. Nonadaptive binary superimposed codes. IEEE Trans. Inform. Theory. 10:1964;363-377.
7. Macula A.J. A simple construction of. d -disjunct matrices with certain constant weights Discrete Math. 162:1996;311-312.
8. Macula A.J. Probabilistic nonadaptive group testing in the presence of errors and DNA library screening. Ann. Combin. 3:1999;61-69.
9. A.J. Macula, P.A. Vilenkin, Constructions of superimposed codes based on incidence structures, IEEE ISIT, Sorrento, Italy, June 25-30, 2000.
10. Ngo H., Du D. New constructions of non-adaptive and error-tolerance pooling designs. Discrete Math. 243:2002;161-170.
11. Ngo H., Zu D. A survey on combinatorial group testing algorithms with applications to DNA library screening. DIMACS Ser. Discrete Math. Theoretical Comp. Sci. 55:2000;171-182.
12. P. Terwilliger, The incidence algebra of a uniform poset, coding theory and design theory, Part I: Coding Theory, IMA Volumes in Mathematics and its Applications, Vol. 20, Springer, New York, 1990, pp. 193-212.
13. P. Terwilliger, Quantum matroids, progress in algebraic combinatorics, Fukuoka, 1993, pp. 323-441; Adv. Stud. Pure Math., Vol. 24, Mathematical Society of Japan, Tokyo, 1996.
14. P. Terwilliger, Quantum matroids, progress in algebraic combinatorics, Fukuoka, 1993, pp. 323-441; Adv. Stud. Pure Math., Vol. 24, Mathematical Society of Japan, Tokyo, 1996.
15. Weng C. D -bounded distance-regular graphs European J. Combin. 18:1997;211-229.