• DOI:10.3934/amc.2018003
• Corpus ID: 4998296

On erasure combinatorial batch codes

@article{Jung2018OnEC,
  title={On erasure combinatorial batch codes},
  author={JiYoon Jung and Carl Mummert and Elizabeth M. Niese and Michael W. Schroeder},
  journal={Adv. Math. Commun.},
  year={2018},
  volume={12},
  pages={49-65}
}

• JiYoon Jung, Carl Mummert, +1 author Michael W. Schroeder
• Published 14 November 2015
• Computer Science
• 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{document}$k$\end{document} items can be retrieved by reading at most \begin{document}$t$\end{document} items from each server. Silberstein defined an erasure batch code (with redundancy \begin{document}$r$\end{document} ) as a batch code in which any \begin{document}$k$\end{document} items can be retrieved by reading at most \begin{document}$t$\end{document} items from each server, while any \begin{document}$r$\end{document} servers are unavailable (failed). In this paper, we investigate erasure batch codes with \begin{document}$t = 1$\end{document} (each server can read at most one item) in a combinatorial manner. We determine the optimal (minimum) total storage of an erasure batch code for several ranges of parameters. Additionally, we relate optimal erasure batch codes to maximum packings. We also identify a necessary lower bound for the total storage of an erasure batch code, and we relate parameters for which this trivial lower bound is achieved to the existence of graphs with appropriate girth.