On erasure combinatorial batch codes

  title={On erasure combinatorial batch codes},
  author={JiYoon Jung and Carl Mummert and Elizabeth M. Niese and Michael W. Schroeder},
  journal={Adv. Math. Commun.},
Combinatorial batch codes were defined by Paterson, Stinson, and Wei as purely combinatorial versions of the batch codes introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai. There are \begin{document}$n$\end{document} items and \begin{document}$m$\end{document} servers, each of which stores a subset of the items. A batch code is an arrangement for storing items on servers so that, for prescribed integers \begin{document}$k$\end{document} and \begin{document}$t$\end{document} , any \begin… 

Figures from this paper

Erasure combinatorial batch codes based on nonadaptive group testing
Based on nonadaptive group testing, three classes of erasure combinatorial batch codes are obtained which 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.
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming
This study forms linear programs so that the optimal solutions provide lower bounds on the total storage of multiset combinatorial batch codes and showed that these lower bounds are either tight or asymptotically tight by constructing the corresponding codes.


Combinatorial batch codes
This paper focuses on batch codes, which were introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [4], and presents batch codes that are optimal with respect to the storage requirement, denoted by N.
Optimal batch codes: Many items or low retrieval requirement
The goal is to determine the minimum N(n,k,m) of F, the union of any $i$ members of $\mathcal F$ has cardinality at least $i, for every $1\le i\le k$ for all combinatorial batch codes.
Combinatorial batch codes and transversal matroids
An important connection is established between combinatorial batch codes and transversal matroids, and this connection is exploited to characterize optimal combinatorian batch codes if $n=m+1$ and $n =m+2$.
Multiset combinatorial batch codes
This paper gives a necessary and sufficient condition for the existence of multiset combinatorial batch codes (MCBCs), and presents several bounds on N(n, k, m, t; r) and constructions of MCBCs.
Relaxations of Hall's condition: Optimal batch codes with multiple queries
The first nontrivial results on combinatorial batch codes with t > 1 are obtained, which can be considered equivalently as minimum total size ∑FєF |F| over all set systems F of given order m and size n, which satisfy a relaxed version of Hall's Condition.
Fractional Repetition and Erasure Batch Codes
Fractional repetition batch (FRB) codes which provide both uncoded repairs and parallel reads of subsets of stored symbols and erasure combinatorial batch codes (ECBCs) are obtained.
Batch codes and their applications
This work demonstrates the usefulness of batch codes by presenting two types of applications: trading maximal load for storage in certain load-balancing scenarios, and amortizing the computational cost of private information retrieval (PIR) and related cryptographic protocols.
t-Designs with t ≥ 3, Handbook of combinatorial designs (Charles
  • Discrete Mathematics and its Applications (Boca Raton),
  • 2007
Coverings and packings
  • Contemporary design theory, Wiley-Intersci. Ser. Discrete Math. Optim., Wiley, New York
  • 1992