Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract)

@inproceedings{Ngo2011EfficientlyDE,
  title={Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract)},
  author={Hung Q. Ngo and Ely Porat and Atri Rudra},
  booktitle={ICALP},
  year={2011}
}
A (d, )-list disjunct matrix is a non-adaptive group testing primitive which, given a set of items with at most d “defectives,” outputs a superset of the defectives containing less than non-defective items. The primitive has found many applications as stand alone objects and as building blocks in the construction of other combinatorial objects. This paper studies error-tolerant list disjunct matrices which can correct up to e0 false positive and e1 false negative tests in sub-linear time. We… CONTINUE READING
Highly Cited
This paper has 53 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 35 extracted citations

54 Citations

0102030'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Combinatorial group testing and its applications, 2nd edn

  • D. Z. Du, F. K. Hwang
  • Series on Applied Mathematics, vol. 12. World…
  • 2000
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…