A class of error-correcting pooling designs over complexes
From MaRDI portal
Publication:987499
DOI10.1007/s10878-008-9179-4zbMath1192.90175OpenAlexW2159894988MaRDI QIDQ987499
Kaishun Wang, Chih-Wen Weng, Tayuan Huang
Publication date: 13 August 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9179-4
Related Items (3)
Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Pooling spaces associated with finite geometry ⋮ Error-correcting pooling designs associated with some distance-regular graphs
Cites Work
- Unnamed Item
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- Pooling spaces associated with finite geometry
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model
- More on pooling spaces
- Sets pooling designs
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
- Generalized cover-free families.
- A note on decoding of superimposed codes
- Pooling spaces and non-adaptive pooling designs
- Nonrandom binary superimposed codes
This page was built for publication: A class of error-correcting pooling designs over complexes
