Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to t positive elements among n samples with as few tests as possible. Disjunct matrices and separable matrices are two classical combinatorial structures while one provides a more efficient decoding algorithm and the other needs fewer tests, i.e., larger rate. Recently, a notion of strongly separable matrix has been introduced, which has the same identifying ability as a disjunct matrix, but has larger rate. In this paper, we use a modified probabilistic method to improve the lower bounds for the rate of strongly separable matrices. Using this method, we also improve the lower bounds for some well-known combinatorial structures, including locally thin set families and cancellative set families.

[1]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[2]  Zoltán Füredi,et al.  Union-free Hypergraphs and Probability Theory , 1984, Eur. J. Comb..

[3]  James B. Shearer,et al.  New Bounds for Union-free Families of Sets , 1998, Electron. J. Comb..

[4]  V. V. Rykov,et al.  Superimposed distance codes , 1989 .

[5]  Ludo M. G. M. Tolhuizen,et al.  New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback , 2000, IEEE Trans. Inf. Theory.

[6]  János Körner,et al.  On Cancellative Set Families , 2007, Comb. Probab. Comput..

[7]  Noga Alon,et al.  String Quartets in Binary , 2000, Combinatorics, Probability and Computing.

[8]  Angelo Monti,et al.  Self-Similarity Bounds for Locally Thin Set Families , 2001, Comb. Probab. Comput..

[9]  A. Sterrett.  On the Detection of Defective Members of Large Populations , 1957 .

[10]  Zoltán Füredi,et al.  Families of Finite Sets in Which No Set Is Covered by the Union of Two Others , 1982, J. Comb. Theory, Ser. A.

[11]  Zoltán Füredi.  2-Cancellative Hypergraphs and Codes , 2012, Comb. Probab. Comput..

[12]  D. Du,et al.  Pooling Designs And Nonadaptive Group Testing: Important Tools For Dna Sequencing , 2006 .

[13]  James B. Shearer,et al.  A New Construction for Cancellative Families of Sets , 1996, Electron. J. Comb..

[14]  Maiko Shigeno,et al.  Strongly separable matrices for nonadaptive combinatorial group testing , 2021, Discret. Appl. Math..

[15]  Gyula O. H. Katona,et al.  Extremal Problems for Hypergraphs , 1975 .

[16]  Noga Alon,et al.  Locally Thin Set Families , 2000, Comb. Probab. Comput..

[17]  János Körner,et al.  A Better Bound for Locally Thin Set Families , 2001, J. Comb. Theory, Ser. A.