Sublinear-Time Non-Adaptive Group Testing With O(k log n) Tests via Bit-Mixing Coding

DOI10.1109/TIT.2020.3046113zbMath1473.62065arXiv1904.10102OpenAlexW3117168083MaRDI QIDQ5003676

Yuda Zhao, Haifeng Yu, Binbin Chen, Steffen Bondorf, Jonathan Scarlett

Publication date: 22 July 2021

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

Full work available at URL: https://arxiv.org/abs/1904.10102

zbMATH Keywords

group testing problemdefective itemsbit mixing coding (BMC)

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Applications of statistics in engineering and industry; control charts (62P30) Randomized algorithms (68W20) Algorithms on strings (68W32)

Related Items (1)

Generalized framework for group testing: queries, feedbacks and adversaries

This page was built for publication: Sublinear-Time Non-Adaptive Group Testing With O(k log n) Tests via Bit-Mixing Coding