تقرير
Combinatorial Group Testing in Presence of Deletions
| العنوان: | Combinatorial Group Testing in Presence of Deletions |
|---|---|
| المؤلفون: | Gandikota, Venkata, Polyanskii, Nikita, Yang, Haodong |
| سنة النشر: | 2023 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Computer Science - Information Theory, Computer Science - Discrete Mathematics |
| الوصف: | The study in group testing aims to develop strategies to identify a small set of defective items among a large population using a few pooled tests. The established techniques have been highly beneficial in a broad spectrum of applications ranging from channel communication to identifying COVID-19-infected individuals efficiently. Despite significant research on group testing and its variants since the 1940s, testing strategies robust to deletion noise have yet to be studied. Many practical systems exhibit deletion errors, for instance, in wireless communication and data storage systems. Such deletions of test outcomes lead to asynchrony between the tests, which the current group testing strategies cannot handle. In this work, we initiate the study of non-adaptive group testing strategies resilient to deletion noise. We characterize the necessary and sufficient conditions to successfully identify the defective items even after the adversarial deletion of certain test outputs. We also provide constructions of testing matrices along with an efficient recovery algorithm. Comment: 14 pages, no figures, 6 Algorithms |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2310.09613 |
| رقم الأكسشن: | edsarx.2310.09613 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |