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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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
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
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
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
Skachek, V.: Batch and PIR Codes and their Connections to Locally Repairable Codes. arXiv:1611.09914v2, March 2017
Bilu, Y., Hoory, S.: On codes from hypergraphs. Eur. J. Comb. 25, 339–354 (2004)
Barg, A., Zémor, G.: Codes on hypergraphs. In: IEEE International Symposium on Information Theory, Toronto, ON, pp. 156–160, July 2008
Sipser, M., Spielman, D.A.: Expander codes. IEEE Trans. Inf. Theory 42, 1710–1722 (1996)
Janwa, H.L., Lal, A.K.: On expander graphs: parameters and applications, preprint. arXiv:0406048
Zémor, G.: On expander codes. IEEE Trans. Inf. Theory 47(2), 835–837 (2001)
Tanner, R.M.: A recursive approach to low complexity codes. IEEE Trans. Inf. Theory 27, 533–547 (1981)
Janwa, H., Lal, A.K.: On Tanner codes: minimum distance and decoding. Proc. AAECC 13, 335–347 (2003)
Rawat, A.S., Mazumdar, A., Vishwanath, S.: Cooperative local repair in distributed storage. arXiv:1409.3900
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)
Kelley, C.A., Sridhara, D.: Eigenvalue bounds on the pseudocodeword weight of expander codes. Adv. Math. Commun 1, 287–307 (2007)
Miladinovic, N., Fossorier, M.P.C.: Generalized LDPC codes and generalized stopping sets. IEEE Trans. Commun. 56, 201–212 (2008)
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)
Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8, 261–277 (1988)
Marcus, A.W., Spielman, D.A., Srivastava, N.: Interlacing families I: bipartite Ramanujan graphs of all degrees. Ann. Math. 182, 307–325 (2015)
Acknowledgements
We thank the anonymous reviewers for their useful comments that improved the quality of the paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)