Name
Abstract | ||
|---|---|---|
In group testing, simple binary-output tests are designed to identify a small number t of defective items that are present in a large population of N items. Each test takes as input a group of items and produces a binary output indicating whether the group is free of the defective items or contains one or more of them. In this paper, we study a relaxation of the combinatorial group testing problem... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TIT.2017.2746564 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Testing,Linear matrix inequalities,Sociology,Statistics,Error correction codes,Random variables,Indexes | Small number,Population,Discrete mathematics,Combinatorial group testing,Combinatorics,Random variable,Matrix (mathematics),Combinatorial design,Group testing,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
63 | 11 | 0018-9448 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Barg | 1 | 910 | 85.90 |
| Arya Mazumdar | 2 | 307 | 41.81 |