Exploring the missing link among d-separable, d-separable and d-disjunct matrices
DOI10.1016/J.DAM.2006.10.009zbMATH Open1119.15027OpenAlexW1982865907MaRDI QIDQ875600FDOQ875600
Authors: Hongbin Chen, Frank K. Hwang 
Publication date: 13 April 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.10.009
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
Genetics and epigenetics (92D10) Hermitian, skew-Hermitian, and related matrices (15B57) Other types of codes (94B60) Separability of topological spaces (54D65)
Cites Work
- Nonrandom binary superimposed codes
- Title not available (Why is that?)
- Families of finite sets in which no set is covered by the union of \(r\) others
- Title not available (Why is that?)
- Union-free hypergraphs and probability theory
- New combinatorial designs and their applications to group testing
- Hypergeometric and Generalized Hypergeometric Group Testing
Cited In (13)
- Disjunct and selective matrices
- Bounds for nonadaptive group tests to estimate the amount of defectives
- On detecting some defective items in group testing
- Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix
- Bounding the number of columns which appear only in positive pools
- Competitive group testing and learning hidden vertex covers with minimum adaptivity
- Descartes product of \((\bar{d}, z)\)-separable matrices and its properties
- Strongly separable matrices for nonadaptive combinatorial group testing
- A class of \(d\)-disjunct matrices constructed by subspaces
- Identifying defective sets using queries of small size
- Almost separable matrices
- Strict group testing and the set basis problem
- 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)
