Error-correcting pooling designs associated with some distance-regular graphs
From MaRDI portal
Publication:967358
DOI10.1016/J.DAM.2009.04.024zbMath1211.05021OpenAlexW2098009329MaRDI QIDQ967358
Tayuan Huang, Kaishun Wang, Yujuan Bai
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.04.024
Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30) Combinatorial codes (94B25)
Related Items (7)
Pooling semilattices and non-adaptive pooling designs ⋮ Erasure combinatorial batch codes based on nonadaptive group testing ⋮ A generalization of Macula's disjunct matrices ⋮ Error-tolerance pooling designs based on Johnson graphs ⋮ Pooling spaces associated with finite geometry ⋮ A construction of pooling designs with surprisingly high degree of error correction ⋮ A NEW CONSTRUCTION FOR POOLING DESIGNS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pooling spaces associated with finite geometry
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model
- A class of error-correcting pooling designs over complexes
- More on pooling spaces
- A simple construction of \(d\)-disjunct matrices with certain constant weights
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
- On Macula's error-correcting pool designs.
- A note on decoding of superimposed codes
- Pooling spaces and non-adaptive pooling designs
- New constructions of non-adaptive and error-tolerance pooling designs
This page was built for publication: Error-correcting pooling designs associated with some distance-regular graphs