Erasure combinatorial batch codes based on nonadaptive group testing

Erasure combinatorial batch codes are a family of codes for distributed storage systems which not only allow for the retrieval of any set of a limited number of items even in presence of server failures, but also balance the load among the servers when retrieving. To present new constructions is one of the objectives of studying erasure combinatorial batch codes. Nonadaptive group testing has many applications to various fields such as DNA library screening and multi-access communications, etc. A lot of constructions of nonadaptive group testing have been given by many authors. In this paper, based on nonadaptive group testing, we obtain three classes of erasure combinatorial batch codes.

[1]  Geng-sheng Zhang,et al.  A construction of dz-disjunct matrices in a dual space of symplectic space , 2008, Discret. Appl. Math..

[2]  Dongdong Jia,et al.  The results on optimal values of some combinatorial batch codes , 2018, Adv. Math. Commun..

[3]  Kaishun Wang,et al.  A construction of pooling designs with surprisingly high degree of error correction , 2011, J. Comb. Theory, Ser. A.

[4]  Natalia Silberstein.  Fractional Repetition and Erasure Batch Codes , 2014, ICMCTA.

[5]  Tayuan Huang,et al.  Error-correcting pooling designs associated with some distance-regular graphs , 2009, Discret. Appl. Math..

[6]  Douglas R. Stinson,et al.  Combinatorial batch codes , 2009, Adv. Math. Commun..

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

[8]  Niranjan Balachandran,et al.  On an extremal hypergraph problem related to combinatorial batch codes , 2012, Discret. Appl. Math..

[9]  Richard A. Brualdi,et al.  Combinatorial batch codes and transversal matroids , 2010, Adv. Math. Commun..

[10]  Rafail Ostrovsky,et al.  Batch codes and their applications , 2004, STOC '04.

[11]  Csilla Bujtás,et al.  Optimal batch codes: Many items or low retrieval requirement , 2011, Adv. Math. Commun..

[12]  Anthony J. Macula,et al.  A simple construction of d-disjunct matrices with certain constant weights , 1996, Discret. Math..

[13]  Tayuan Huang,et al.  Pooling spaces and non-adaptive pooling designs , 2004, Discret. Math..

[14]  Csilla Bujtás,et al.  Optimal combinatorial batch codes derived from dual systems , 2011 .

[15]  Csilla Bujtás,et al.  Turán numbers and batch codes , 2013, Discret. Appl. Math..

[16]  Carl Mummert,et al.  On erasure combinatorial batch codes , 2018, Adv. Math. Commun..

[17]  Natalia Silberstein,et al.  Optimal combinatorial batch codes based on block designs , 2016, Des. Codes Cryptogr..

[18]  Geng-sheng Zhang,et al.  A construction of dz-disjunct matrices by orthogonal space and discussion on their design parameters , 2009, Discret. Math..

[19]  Geng-sheng Zhang,et al.  Error-correcting pooling designs associated with the dual space of unitary space and ratio efficiency comparison , 2009, J. Comb. Optim..

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

[21]  P. Pardalos,et al.  Group testing with geometry of classical groups over finite fields , 2018, Journal of Algebraic Combinatorics.

[22]  Ding-Zhu Du,et al.  New constructions of non-adaptive and error-tolerance pooling designs , 2002, Discret. Math..