On the upper bounds of the minimum number of rows of disjunct matrices

A 0-1 matrix is d-disjunct if no column is covered by the union of any d other columns. A 0-1 matrix is (d; z)-disjunct if for any column C and any d other columns, there exist at least z rows such that each of them has value 1 at column C and value 0 at all the other d columns. Let t(d, n) and t(d, n; z) denote the minimum number of rows required by a d-disjunct matrix and a (d; z)-disjunct matrix with n columns, respectively. We give a very short proof for the currently best upper bound on t(d, n). We also generalize our method to obtain a new upper bound on t(d, n; z).

[1]  Richard C. Singleton,et al.  Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

[2]  Ding-Zhu Du,et al.  A survey on combinatorial group testing algorithms with applications to DNA Library Screening , 1999, Discrete Mathematical Problems with Medical Applications.

[3]  Zoltán Füredi.  On r-Cover-free Families , 1996, J. Comb. Theory, Ser. A.

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

[5]  D. Balding,et al.  Efficient pooling designs for library screening. , 1994, Genomics.

[6]  Jack K. Wolf,et al.  Born again group testing: Multiaccess communications , 1985, IEEE Trans. Inf. Theory.

[7]  Miklós Ruszinkó,et al.  On the Upper Bound of the Size of the R-Cover-Free Families , 1993, Proceedings. IEEE International Symposium on Information Theory.

[8]  P. Erdös,et al.  Families of finite sets in which no set is covered by the union ofr others , 1985 .

[9]  Arkadii G. D'yachkov,et al.  New constructions of superimposed codes , 2000, IEEE Trans. Inf. Theory.

[10]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[11]  Emanuel Knill,et al.  A Comparative Survey of Non-Adaptive Pooling Designs , 1996 .

[12]  Weili Wu,et al.  New Construction for Transversal Design , 2006, J. Comput. Biol..

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

[14]  Anthony J. Macula,et al.  Error-correcting Nonadaptive Group Testing with de-disjunct Matrices , 1997, Discret. Appl. Math..