Erasure correction and locality of hypergraph codes

Allison Beemer, Carolyn Mayer, Christine A. Kelley

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

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.

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
Pages21-29
Number of pages9
ISBN (Print)9783319662770
DOIs
StatePublished - Jan 1 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

Other

Other5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017
CountryEstonia
CityVihula
Period8/28/178/31/17

Fingerprint

Hypergraph
Locality
Storage System
Regular Graph
Bipartite Graph
Distributed Systems

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Beemer, A., Mayer, C., & Kelley, C. A. (2017). Erasure correction and locality of hypergraph codes. In A. I. Barbero, V. Skachek, & O. Beck (Eds.), Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings (pp. 21-29). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10495 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-66278-7_3

Erasure correction and locality of hypergraph codes. / Beemer, Allison; Mayer, Carolyn; Kelley, Christine A.

Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. ed. / Angela I. Barbero; Vitaly Skachek; Oyvind Beck. Springer Verlag, 2017. p. 21-29 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10495 LNCS).

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

Beemer, A, Mayer, C & Kelley, CA 2017, Erasure correction and locality of hypergraph codes. in AI Barbero, V Skachek & O Beck (eds), Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10495 LNCS, Springer Verlag, pp. 21-29, 5th International Castle Meeting on Coding Theory and Applications, ICMCTA 2017, Vihula, Estonia, 8/28/17. https://doi.org/10.1007/978-3-319-66278-7_3
Beemer A, Mayer C, Kelley CA. Erasure correction and locality of hypergraph codes. In Barbero AI, Skachek V, Beck O, editors, Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. Springer Verlag. 2017. p. 21-29. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-66278-7_3
Beemer, Allison ; Mayer, Carolyn ; Kelley, Christine A. / Erasure correction and locality of hypergraph codes. Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. editor / Angela I. Barbero ; Vitaly Skachek ; Oyvind Beck. Springer Verlag, 2017. pp. 21-29 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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",
month = "1",
day = "1",
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",

}

TY - GEN

T1 - Erasure correction and locality of hypergraph codes

AU - Beemer, Allison

AU - Mayer, Carolyn

AU - Kelley, Christine A.

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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.

AB - 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.

KW - (r, ℓ)-cooperative locality

KW - Availability

KW - Expander graphs

KW - Generalized LDPC codes

KW - Hypergraphs

KW - Locality

KW - Stopping sets

UR - http://www.scopus.com/inward/record.url?scp=85028541048&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85028541048&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-66278-7_3

DO - 10.1007/978-3-319-66278-7_3

M3 - Conference contribution

AN - SCOPUS:85028541048

SN - 9783319662770

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 21

EP - 29

BT - Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings

A2 - Barbero, Angela I.

A2 - Skachek, Vitaly

A2 - Beck, Oyvind

PB - Springer Verlag

ER -