Efficient Algorithms for Noisy Group Testing

DOI10.1109/TIT.2017.2659619MaRDI QIDQ5280887zbMATH OpenOpenAlexFDO

Authors Sheng Cai, Mohammad Jahangoshahi, Mayank Bakshi, Sidharth Jaggi

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2017.2659619

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited in

(7)

• A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework
• Exact learning from an honest teacher that answers membership queries
• Noise-Resilient Group Testing: Limitations and Constructions
• Efficient testing of groups
• Performance of Group Testing Algorithms With Near-Constant Tests Per Item
• A tractable non-adaptative group testing method for non-binary measurements
• scientific article; zbMATH DE number 7758315 (Why is no real title available?)

This page was built for publication: Efficient Algorithms for Noisy Group Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280887)