Skip to main content
SpringerLink
Log in

Constructions and Bounds for Batch Codes with Small Parameters

  • Conference paper
  • First Online:
Coding Theory and Applications (ICMCTA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10495))

Included in the following conference series:

Abstract

Linear batch codes and codes for private information retrieval (PIR) with a query size t and a restricted size r of the reconstruction sets are studied. New bounds on the parameters of such codes are derived for small values of t or r by providing corresponding constructions. By building on the ideas of Cadambe and Mazumdar, a new bound in a recursive form is derived for batch codes and PIR codes.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. 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)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bujtas, C., Tuza, Z.: Batch codes and their applications. Electron. Notes Discrete Math. 38, 201–206 (2011)

    Article  MATH  Google Scholar 

  4. Cadambe, V., Mazumdar, A.: Bounds on the size of locally recoverable codes. IEEE Trans. Inf. Theory 61(11), 5787–5794 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chee, Y.M., Gao, F., Teo, S.T.H., Zhang, H.: Combinatorial systematic switch codes. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), Hong Kong, China, pp. 241–245 (2015)

    Google Scholar 

  6. Dimakis, A.G., Gal, A., Rawat, A.S., Song, Z.: Batch codes through dense graphs without short cycles, arXiv:1410.2920, October 2014

  7. Fazeli, A., Vardy, A., Yaakobi, E.: PIR with low storage overhead: coding instead of replication, arXiv:1505.06241, May 2015

  8. Forbes, M., Yekhanin, S.: On the locality of codeword sysmbols in non-linear codes. Discrete Math. 324, 78–84 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  9. Gopalan, P., Huang, C., Simitci, H., Yekhanin, S.: On the locality of codeword symbols. IEEE Trans. Inform. Theory 58(11), 6925–6934 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applications. In: Proceeding of the 36th ACM Symposium on Theory of Computing (STOC), Chicago, June 2004

    Google Scholar 

  11. Lipmaa, H., Skachek, V.: Linear batch codes. In: Proceedings of the 4th International Castle Meeting on Coding Theory and Applications, Palmela, Portugal, September 2014

    Google Scholar 

  12. Rawat, A.S., Mazumdar, A., Vishwanath, S.: Cooperative local repair in distributed storage. EURASIP J. Adv. Sign. Process. 1, 107 (2015)

    Google Scholar 

  13. Rawat, A.S., Papailiopoulos, D.S., Dimakis, A.G., Vishwanath, S.: Locality and availability in distributed storage. IEEE Trans. Inform. Theory 62(8), 4481–4493 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  14. Roth, R.M.: Introduction to Coding Theory. Cambridge University Press, Cambridge (2006)

    Book  MATH  Google Scholar 

  15. Skachek, V.: Batch and PIR Codes and Their Connections to Locally Repairable Codes, arXiv:1611.09914, November 2016

  16. Tamo, I., Barg, A.: Bounds on Locally Recoverable Codes with Multiple Recovering Sets (2014). arXiv:1402.0916v1

  17. Vardy, A., Yaakobi, E.: Constructions of batch codes with near-optimal redundancy. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), Barcelona (2016)

    Google Scholar 

  18. Wang, Z., Kiah, H.M., Cassuto, Y.: Optimal binary switch codes with small query size. In: Proceeding of the IEEE International Symposium on Information Theory (ISIT), Hong Kong, pp. 636–640, June 2015

    Google Scholar 

  19. Wang, Z., Shaked, O., Cassuto, Y., Bruck, J.: Codes for network switches. In: Proceeding of the IEEE International Symposium on Information Theory (ISIT), Istanbul (2013)

    Google Scholar 

  20. Wang, A., Zhang, Z.: Achieving Arbitrary Locality and Availability in Binary Codes, arXiv:1501.04264v1 (January 2015)

  21. Zhang, H., Skachek, V.: Bounds for batch codes with restricted query size. In: Proceeding of the IEEE International Symposium on Information Theory (ISIT), Barcelona, pp. 1192–1196 (2016)

    Google Scholar 

Download references

Acknowledgment

The work of E. Thomas and V. Skachek is supported by the Estonian Research Council under the grants PUT405 and IUT2-1. The authors wish to thank Mart Simisker for valuable comments on the earliest version of this work.

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Tartu, Tartu, Estonia

    Eldho K. Thomas & Vitaly Skachek

Authors
  1. Eldho K. Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vitaly Skachek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Eldho K. Thomas or Vitaly Skachek .

Editor information

Editors and Affiliations

  1. University of Valladolid, Valladolid, Spain

    Ángela I. Barbero

  2. University of Tartu, Tartu, Estonia

    Vitaly Skachek

  3. Simula@UiB and University of Bergen, Bergen, Norway

    Øyvind Ytrehus

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Thomas, E.K., Skachek, V. (2017). Constructions and Bounds for Batch Codes with Small Parameters. In: Barbero, Á., Skachek, V., Ytrehus, Ø. (eds) Coding Theory and Applications. ICMCTA 2017. Lecture Notes in Computer Science(), vol 10495. Springer, Cham. https://doi.org/10.1007/978-3-319-66278-7_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66278-7_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66277-0

  • Online ISBN: 978-3-319-66278-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation