Erasure correction and locality of hypergraph codes

Allison Beemer, Carolyn Mayer, Christine A. Kelley

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationCoding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings
EditorsAngela I. Barbero, Vitaly Skachek, Oyvind Beck
PublisherSpringer Verlag
Number of pages9
ISBN (Print)9783319662770
StatePublished - 2017
Event5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017 - Vihula, Estonia
Duration: Aug 28 2017Aug 31 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10495 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017


  • (r, ℓ)-cooperative locality
  • Availability
  • Expander graphs
  • Generalized LDPC codes
  • Hypergraphs
  • Locality
  • Stopping sets

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Erasure correction and locality of hypergraph codes'. Together they form a unique fingerprint.

Cite this