Group Testing Algorithms: Bounds and Simulations

We consider the problem of nonadaptive noiseless group testing of N items of which K are defective. We describe four detection algorithms, the COMP algorithm of Chan et al., two new algorithms, DD and SCOMP, which require stronger evidence to declare an item defective, and an essentially optimal but...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2014-06, Vol.60 (6), p.3671-3687
Hauptverfasser:	Aldridge, Matthew, Baldassini, Leonardo, Johnson, Oliver
Format:	Artikel
Sprache:	eng
Schlagworte:	Adaptive algorithms Algorithm design and analysis Algorithms Applied sciences Asymptotic methods Asymptotic properties Computation Computer simulation Decoding Detection algorithms Exact sciences and technology Inference algorithms Information theory Information, signal and communications theory Matching pursuit algorithms Optimization Random processes Simulation Telecommunications and information theory Testing Upper bound
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!