20 citations · 49 across the 17 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures
Bingchen Qian, Xin Wang, Gennian Ge
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to positive elements among samples with as few tests a…
cs.IT2021
Improved Lower Bounds for Secure Codes and Related Structures
Bingchen Qian, Xin Wang, Gennian Ge
Secure codes are widely-studied combinatorial structures which were introduced for traitor tracing in broadcast encryption. To determine the maximum size of such structures is the…