Combinatorial batch codes: A lower bound and optimal constructions
Srimanta Bhattacharya - Applied Statistics Unit, Indian Statistical Institute, 203 B T Road, Kolkata 700 108, India (email)
Batch codes, introduced by Ishai et al. in , are methods for solving the following data storage problem: $n$ data items are to be stored in $m$ servers in such a way that any $k$ of the $n$ items can be retrieved by reading at most $t$ items from each server, and that the total number of items stored in $m$ servers is $N$. A combinatorial batch code (CBC) is a batch code where each data item is stored without change, i.e., each stored data item is a copy of one of the $n$ data items.
Keywords: Combinatorial batch codes, Hall's theorem, binary constant weight
Received: February 2011; Revised: December 2011; Published: April 2012.
2011 Impact Factor.462