Linear Batch Codes

Part of the CIM Series in Mathematical Sciences book series (CIMSMS, volume 3)

Abstract

In an application, where a client wants to obtain many symbols from a large database, it is often desirable to balance the load. Batch codes (introduced by Ishai et al. in STOC 2004) do exactly that: the large database is divided between many servers, so that the client has to only make a small number of queries to every server to obtain sufficient information to reconstruct all desired symbols.

In this work, we formalize the study of linear batch codes. These codes, in particular, are of potential use in distributed storage systems. We show that a generator matrix of a binary linear batch code is also a generator matrix of classical binary linear error-correcting code. This immediately yields that a variety of upper bounds, which were developed for error-correcting codes, are applicable also to binary linear batch codes. We also propose new methods for constructing large linear batch codes from the smaller ones.

Keywords

Batch codes Error-correcting codes Computationally-private information retrieval Load balancing Distributed storage 

References

  1. 1.
    Bar-Yossef, Z., Birk, Y., Jayram, T.S., Kol, T.: Index coding with side information. IEEE Trans. Inf. Theory 57(3), 1479–1494 (2011)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bhattacharya, S., Ruj, S., Roy, B.: Combinatorial batch codes: a lower bound and optimal constructions. Adv. Math. Commun. 6(2), 165–174 (2012)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Brualdi, R.A., Kiernan, K., Meyer, S.A., Schroeder, M.W.: Combinatorial batch codes and transversal matroids. Adv. Math. Commun. 4(3), 419–431 (2010)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Bujtás, C., Tuza, Z.: Batch codes and their applications. Electron. Notes Discret. Math. 38, 201–206 (2011)CrossRefGoogle Scholar
  5. 5.
    Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proceedings of the 36th Symposium on Foundations of Computer Science (FOCS), Milwaukee, Wisconsin, USA pp. 41–50 (1995)Google Scholar
  6. 6.
    Dimakis, A.G., Godfrey, P.B., Wu, Y., Wainwright, M.J., Ramchandran, K.: Network coding for distributed storage systems. IEEE Trans. Inf. Theory 59(9), 4539–4551 (2010)CrossRefGoogle Scholar
  7. 7.
    Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applications. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), Chicago (2004)Google Scholar
  8. 8.
    Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: Proceedings of the 38th Symposium on Foundations of Computer Science (FOCS), Miami Beach, Florida, USA pp. 364–373 (1997)Google Scholar
  9. 9.
    Lipmaa, H.: First CPIR protocol with data-dependent computation. In: Proceedings of the International Conference on Information Security and Cryptology (ICISC), Seoul, South Korea pp. 193–210 (2009)Google Scholar
  10. 10.
    Lipmaa, H., Skachek, V.: Linear batch codes. Available online http://arxiv.org/abs/1404.2796
  11. 11.
    MacWilliams, F.J.: A theorem on the distribution of weights in a systematic code. Bell Syst. Tech. J. 42, 79–94 (1963)MathSciNetCrossRefGoogle Scholar
  12. 12.
    MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1978)Google Scholar
  13. 13.
    McEliece, R.J., Rodemich, E.R., Rumsey, H., Welch, L.R.: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE Trans. Inf. Theory IT-23, 157–166 (1997)MathSciNetGoogle Scholar
  14. 14.
    Roth, R.M.: Introduction to Coding Theory. Cambridge University Press, Cambridge (2006)CrossRefMATHGoogle Scholar
  15. 15.
    Silberstein, N., Gál, A.: Optimal combinatorial batch codes based on block designs. Available online http://arxiv.org/abs/1312.5505
  16. 16.
    Stinson, D., Wei, R., Paterson, M.: Combinatorial batch codes. Adv. Math. Commun. 3(1), 13–17 (2009)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Institute of Computer ScienceUniversity of TartuTartuEstonia

Personalised recommendations