Smart elements in combinatorial group testing problems with more defectives

Authors

  • Máté Vizer Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Hungary https://orcid.org/0000-0002-2360-3918
  • Dániel Gerbner Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Hungary

DOI:

https://doi.org/10.26493/2590-9770.1363.b06

Keywords:

Combinatorial group testing, defectives, cancellative

Abstract

In combinatorial group testing problems Questioner needs to find a defective element x ∈ [n] by testing subsets of [n]. In [18] the authors introduced a new model, where each element knows the answer for those queries that contain it and each element should be able to identify the defective one.

In this article we continue to investigate this kind of models with more defective elements. We also consider related models inspired by secret sharing models, where the elements should share information among them to find out the defectives. Finally the adaptive versions of the different models are also investigated.

Published

2020-08-14

Issue

Section

Articles