Skip to main content
SpringerLink
Log in

Erasure Correction and Locality of Hypergraph Codes

  • 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:

  • 799 Accesses

Abstract

We examine erasure correction and locality properties of regular and biregular hypergraph codes. We propose a construction of t-uniform t-partite biregular hypergraphs based on (c, d)-regular bipartite graphs. We show that for both the regular and biregular case, when the underlying hypergraph has expansion properties, the guaranteed erasure correcting capability for the resulting codes is improved. We provide bounds on the minimum stopping set size and cooperative locality of these hypergraph codes for application in distributed storage systems.

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. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applications. In: ACM Symposium on Theory of Computation, Chicago, IL, pp. 262–271, June 2004

    Google Scholar 

  2. Dimakis, A.G., Ramchandran, K., Wu, Y., Suh, C.: A survey on network codes for distributed storage. In: Proceedings of IEEE, vol. 99, no. 3, March 2011

    Google Scholar 

  3. Kamath, G.M., Prakash, N., Lalitha, V., Kumar, P.V.: Codes with local regeneration. In: IEEE Information Theory and Application Workshop, pp. 1–5, San Diego, CA, February 2013

    Google Scholar 

  4. Ernvall, T., Westerbäck, T., Freij-Hollanti, R., Hollanti, C.: A connection between locally repairable codes and exact regenerating codes. In: Proceedings of IEEE International Symposium on Information Theory, Barcelona, July 2016

    Google Scholar 

  5. Skachek, V.: Batch and PIR Codes and their Connections to Locally Repairable Codes. arXiv:1611.09914v2, March 2017

  6. Bilu, Y., Hoory, S.: On codes from hypergraphs. Eur. J. Comb. 25, 339–354 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Barg, A., Zémor, G.: Codes on hypergraphs. In: IEEE International Symposium on Information Theory, Toronto, ON, pp. 156–160, July 2008

    Google Scholar 

  8. Sipser, M., Spielman, D.A.: Expander codes. IEEE Trans. Inf. Theory 42, 1710–1722 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  9. Janwa, H.L., Lal, A.K.: On expander graphs: parameters and applications, preprint. arXiv:0406048

  10. Zémor, G.: On expander codes. IEEE Trans. Inf. Theory 47(2), 835–837 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Tanner, R.M.: A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27, 533–547 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  12. Janwa, H., Lal, A.K.: On Tanner codes: minimum distance and decoding. Proc. AAECC 13, 335–347 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Rawat, A.S., Mazumdar, A., Vishwanath, S.: Cooperative local repair in distributed storage. arXiv:1409.3900

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Kelley, C.A., Sridhara, D.: Eigenvalue bounds on the pseudocodeword weight of expander codes. Adv. Math. Commun 1, 287–307 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  16. Miladinovic, N., Fossorier, M.P.C.: Generalized LDPC codes and generalized stopping sets. IEEE Trans. Commun. 56, 201–212 (2008)

    Article  Google Scholar 

  17. Di, C., Proietti, D., Richardson, T., Teletar, E., Urbanke, R.: Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Trans. Inf. Theory 48, 1570–1579 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  18. Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8, 261–277 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  19. Marcus, A.W., Spielman, D.A., Srivastava, N.: Interlacing families I: bipartite Ramanujan graphs of all degrees. Ann. Math. 182, 307–325 (2015)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

We thank the anonymous reviewers for their useful comments that improved the quality of the paper.

Author information

Authors and Affiliations

  1. University of Nebraska-Lincoln, Lincoln, NE, USA

    Allison Beemer, Carolyn Mayer & Christine A. Kelley

Authors
  1. Allison Beemer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carolyn Mayer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christine A. Kelley
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carolyn Mayer .

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

Beemer, A., Mayer, C., Kelley, C.A. (2017). Erasure Correction and Locality of Hypergraph Codes. 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_3

Download citation

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

  • 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