Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 69 tok/s
Gemini 2.5 Pro 58 tok/s Pro
GPT-5 Medium 32 tok/s Pro
GPT-5 High 29 tok/s Pro
GPT-4o 108 tok/s Pro
Kimi K2 198 tok/s Pro
GPT OSS 120B 461 tok/s Pro
Claude Sonnet 4.5 33 tok/s Pro
2000 character limit reached

Efficient Combinatorial Group Testing: Bridging the Gap between Union-Free and Disjunctive Codes (2401.16540v1)

Published 29 Jan 2024 in cs.IT and math.IT

Abstract: This work focuses on non-adaptive group testing, with a primary goal of efficiently identifying a set of at most $d$ defective elements among a given set of elements using the fewest possible number of tests. Non-adaptive combinatorial group testing often employs disjunctive codes and union-free codes. This paper discusses union-free codes with fast decoding (UFFD codes), a recently introduced class of union-free codes that combine the best of both worlds -- the linear complexity decoding of disjunctive codes and the fewest number of tests of union-free codes. In our study, we distinguish two subclasses of these codes -- one subclass, denoted as $(=d)$-UFFD codes, can be used when the number of defectives $d$ is a priori known, whereas $(\le d)$-UFFD codes works for any subset of at most $d$ defectives. Previous studies have established a lower bound on the rate of these codes for $d=2$. Our contribution lies in deriving new lower bounds on the rate for both $(=d)$- and $(\le d)$-UFFD codes for an arbitrary number $d \ge 2$ of defectives. Our results show that for $d\to\infty$, the rate of $(=d)$-UFFD codes is twice as large as the best-known lower bound on the rate of $d$-disjunctive codes. In addition, the rate of $(\le d)$-UFFD code is shown to be better than the known lower bound on the rate of $d$-disjunctive codes for small values of $d$.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (26)
  1. R. Dorfman, “The detection of defective members of large populations,” The Annals of mathematical statistics, vol. 14, no. 4, pp. 436–440, 1943.
  2. M. Aldridge and D. Ellis, “Pooled testing and its applications in the covid-19 pandemic,” Pandemics: Insurance and Social Protection, pp. 217–249, 2022.
  3. M. Aldridge, O. Johnson, J. Scarlett et al., “Group testing: an information theory perspective,” Foundations and Trends® in Communications and Information Theory, vol. 15, no. 3-4, pp. 196–392, 2019.
  4. A. D’yachkov, “Lectures on designing screening experiments, com2mac lect,” Note Ser, vol. 10.
  5. W. Kautz and R. Singleton, “Nonrandom binary superimposed codes,” IEEE Transactions on Information Theory, vol. 10, no. 4, pp. 363–377, 1964.
  6. A. G. D’yachkov, “Lectures on designing screening experiments,” arXiv preprint arXiv:1401.7505, 2014.
  7. A. G. Dyachkov, V. Rykov, and A. Rashad, “Superimposed distance codes,” Problems of Control and Information Theory-problemy Upravleniya i Teorii Informatsii, vol. 18, no. 4, pp. 237–250, 1989.
  8. A. G. D’yachkov and V. V. Rykov, “Bounds on the length of disjunctive codes,” Problemy Peredachi Informatsii, vol. 18, no. 3, pp. 7–13, 1982.
  9. J. Fan, H.-L. Fu, Y. Gu, Y. Miao, and M. Shigeno, “Strongly separable matrices for nonadaptive combinatorial group testing,” Discrete Applied Mathematics, vol. 291, pp. 180–187, 2021.
  10. I. Vorobyev, “Fast decoding of union-free codes,” in 2021 XVII International Symposium" Problems of Redundancy in Information and Control Systems"(REDUNDANCY).   IEEE, 2021, pp. 106–109.
  11. D. Coppersmith and J. B. Shearer, “New bounds for union-free families of sets,” the electronic journal of combinatorics, vol. 5, no. 1, p. R39, 1998.
  12. S. Cai, M. Jahangoshahi, M. Bakshi, and S. Jaggi, “Efficient algorithms for noisy group testing,” IEEE Transactions on Information Theory, vol. 63, no. 4, pp. 2113–2136, 2017.
  13. H. A. Inan, P. Kairouz, M. Wootters, and A. Özgür, “On the optimality of the kautz-singleton construction in probabilistic group testing,” IEEE Transactions on Information Theory, vol. 65, no. 9, pp. 5592–5603, 2019.
  14. K. Lee, K. Chandrasekher, R. Pedarsani, and K. Ramchandran, “Saffron: A fast, efficient, and robust framework for group testing based on sparse-graph codes,” IEEE Transactions on Signal Processing, vol. 67, no. 17, pp. 4649–4664, 2019.
  15. E. Price and J. Scarlett, “A fast binary splitting approach to non-adaptive group testing,” arXiv preprint arXiv:2006.10268, 2020.
  16. M. Cheraghchi and V. Nakos, “Combinatorial group testing and sparse recovery schemes with near-optimal decoding time,” in 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).   IEEE, 2020, pp. 1203–1213.
  17. A. Coja-Oghlan, O. Gebhard, M. Hahn-Klimroth, and P. Loick, “Optimal group testing,” in Conference on Learning Theory.   PMLR, 2020, pp. 1374–1388.
  18. S. Bondorf, B. Chen, J. Scarlett, H. Yu, and Y. Zhao, “Sublinear-time non-adaptive group testing with o (k log n) tests via bit-mixing coding,” IEEE Transactions on Information Theory, vol. 67, no. 3, pp. 1559–1570, 2020.
  19. H.-P. Wang, R. Gabrys, and V. Guruswami, “Quickly-decodable group testing with fewer tests: Price–scarlett’s nonadaptive splitting with explicit scalars,” in 2023 IEEE International Symposium on Information Theory (ISIT).   IEEE, 2023, pp. 1609–1614.
  20. M. Aldridge, L. Baldassini, and O. Johnson, “Group testing algorithms: Bounds and simulations,” IEEE Transactions on Information Theory, vol. 60, no. 6, pp. 3671–3687, 2014.
  21. A. G. Dyachkov and V. V. Rykov, “A survey of superimposed code theory,” Problems of Control and Information Theory, vol. 12, no. 4, pp. 1–13, 1983.
  22. P. Erdös, P. Frankl, and Z. Füredi, “Families of finite sets in which no set is covered by the union of two others,” Journal of Combinatorial Theory, Series A, vol. 33, no. 2, pp. 158–166, 1982.
  23. A. G. D’yachkov, I. V. Vorob’ev, N. Polyansky, and V. Y. Shchukin, “Almost disjunctive list-decoding codes,” Problems of Information Transmission, vol. 51, pp. 110–131, 2015.
  24. A. Quang, “Bounds on constant weight binary superimposed codes.” Problems Control Inf. Theory., vol. 17, no. 4, pp. 223–230, 1988.
  25. M. Ruszinkó, “On the upper bound of the size of the r-cover-free families,” Journal of Combinatorial Theory, Series A, vol. 66, no. 2, pp. 302–310, 1994.
  26. Z. Füredi, “On r𝑟ritalic_r-cover-free families,” Journal of Combinatorial Theory, Series A, vol. 73, no. 1, pp. 172–173, 1996.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up