Exploring the missing link among d-separable, d-separable and d-disjunct matrices
From MaRDI portal
(Redirected from Publication:875600)
Recommendations
- A class of \(d\)-disjunct matrices constructed by subspaces
- Bounding the number of columns which appear only in positive pools
- \(d\)-disjunct matrices: Bounds and Lovász local lemma
- On the upper bounds of the minimum number of rows of disjunct matrices
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
Cites work
- scientific article; zbMATH DE number 65702 (Why is no real title available?)
- scientific article; zbMATH DE number 956611 (Why is no real title available?)
- Families of finite sets in which no set is covered by the union of \(r\) others
- Hypergeometric and Generalized Hypergeometric Group Testing
- New combinatorial designs and their applications to group testing
- Nonrandom binary superimposed codes
- Union-free hypergraphs and probability theory
Cited in
(13)- Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix
- On detecting some defective items in group testing
- Bounding the number of columns which appear only in positive pools
- Strict group testing and the set basis problem
- Competitive group testing and learning hidden vertex covers with minimum adaptivity
- Descartes product of \((\bar{d}, z)\)-separable matrices and its properties
- A class of \(d\)-disjunct matrices constructed by subspaces
- Strongly separable matrices for nonadaptive combinatorial group testing
- Disjunct and selective matrices
- Almost separable matrices
- Bounds for nonadaptive group tests to estimate the amount of defectives
- Identifying defective sets using queries of small size
- Randomized group testing both query-optimal and minimal adaptive
This page was built for publication: Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875600)
