Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Optimal combinatorial batch codes based on block designs


Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai, represent the distributed storage of an \(n\)-element data set on \(m\) servers in such a way that any batch of \(k\) data items can be retrieved by reading at most one (or more generally, \(t\)) items from each server, while keeping the total storage over \(m\) servers equal to \(N\). This paper considers a class of batch codes (for \(t=1\)), called combinatorial batch codes (CBCs), where each server stores a subset of a database. A CBC is called optimal if the total storage \(N\) is minimal for given \(n,m\), and \(k\). A \(c\)-uniform CBC is a combinatorial batch code where each item is stored in exactly \(c\) servers. A \(c\)-uniform CBC is called optimal if its parameter \(n\) has maximum value for given \(m\) and \(k\). Optimal \(c\)-uniform CBCs have been known only for \(c\in \{2,k-1,k-2\}\). In this paper we present new constructions of optimal CBCs in both the uniform and general settings, for values of the parameters where tight bounds have not been established previously. In the uniform setting, we provide constructions of two new families of optimal uniform codes with \(c\sim \sqrt{k}\). Our constructions are based on affine planes and transversal designs.

This is a preview of subscription content, log in to check access.


  1. 1.

    Agrell E., Vardy A., Zeger K.: Upper bounds for constant-weight codes. IEEE Trans. Inf. Theory 46(7), 2373–2395 (2000).

  2. 2.

    Anderson I.: Combinatorial Designs and Tournaments. Clarendon Press, Oxford (1997).

  3. 3.

    Balachandran N., Bhattacharya S.: On an extremal hypergraph problem related to combinatorial batch codes. Discret. Appl. Math. 162, 373–380 (2014).

  4. 4.

    Bhattacharya S., Ruj S., Roy B.: Combinatorial batch codes: a lower bound and optimal constructions. Adv. Math. Commun. 3(1), 165–174 (2012).

  5. 5.

    Brown W.G., Erdös P., Sós V.T.: On some extremal problems on r-graphs. New directions in the theory of graphs. In: Proceedings of the Third Ann Arbor Conference, University Michigan, 1971, pp. 53–63. Academic Press, New York (1973).

  6. 6.

    Brualdi R.A., Kiernan K.P., Meyer S.A., Schroeder M.W.: Combinatorial batch codes and transversal matroids. Adv. Math. Commun. 4(3), 419–431 (2010).

  7. 7.

    Bujtás C., Tuza Z.: Optimal batch codes: many items or low retrieval requirement. Adv. Math. Commun. 5(3), 529–541 (2011).

  8. 8.

    Bujtás C., Tuza Z.: Optimal combinatorial batch codes derived from dual systems. Miskolc Math. Notes 12(1), 11–23 (2011).

  9. 9.

    Bujtás C., Tuza Z.: Relaxations of Hall’s condition: optimal batch codes with multiple queries. Appl. Anal. Discret. Math. 6(1) 72–81 (2012).

  10. 10.

    Bujtás C., Tuza Z.: Turán numbers and batch codes. arXiv:1309.6506 (2013).

  11. 11.

    Ishai Y., Kushilevitz E., Ostrovsky R., Sahai A.: Batch codes and their applications. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing STOC ’04, pp. 262–271 (2004).

  12. 12.

    Paterson M.B., Stinson D.R., Wei R.: Combinatorial batch codes. Adv. Math. Commun. 3(1), 13–27 (2009).

  13. 13.

    Ruj S., Roy B.: More on combinatorial batch codes. arXiv:0809.3357 (2008).

Download references


The authors thank the anonymous referees for their valuable comments that helped to improve the presentation of the paper. N. Silberstein was supported in part at the Technion by a Fine Fellowship. A. Gál was supported in part by NSF Grant CCF-1018060. A preliminary version of the paper is available at http://arxiv.org/abs/1312.5505.

Author information

Correspondence to Natalia Silberstein.

Additional information

Communicated by C. J. Colbourn.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Silberstein, N., Gál, A. Optimal combinatorial batch codes based on block designs. Des. Codes Cryptogr. 78, 409–424 (2016). https://doi.org/10.1007/s10623-014-0007-9

Download citation


  • Batch codes
  • Transversal designs
  • Affine planes

Mathematics Subject Classification

  • 94B60
  • 94C30