@inproceedings{0d3dd6a2df854304aff8b1e32c19a773,
title = "Erasure correction and locality of hypergraph codes",
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.",
keywords = "(r, ℓ)-cooperative locality, Availability, Expander graphs, Generalized LDPC codes, Hypergraphs, Locality, Stopping sets",
author = "Allison Beemer and Carolyn Mayer and Kelley, {Christine A.}",
year = "2017",
doi = "10.1007/978-3-319-66278-7_3",
language = "English (US)",
isbn = "9783319662770",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "21--29",
editor = "Barbero, {Angela I.} and Vitaly Skachek and Oyvind Beck",
booktitle = "Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings",
note = "5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017 ; Conference date: 28-08-2017 Through 31-08-2017",
}