Sublinear-Time Non-Adaptive Group Testing With O(k log n) Tests via Bit-Mixing Coding
From MaRDI portal
Publication:5003676
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
Parametric hypothesis testing (62F03) Applications of statistics in engineering and industry; control charts (62P30) Randomized algorithms (68W20) Algorithms on strings (68W32)
Related Items (1)
This page was built for publication: Sublinear-Time Non-Adaptive Group Testing With O(k log n) Tests via Bit-Mixing Coding