Correctable Erasure Patterns in Product Topologies

Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi, Antonia Wachter-Zeh

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

42 Downloads (Pure)

Abstract

Locality enables storage systems to recover failed nodes from small subsets of surviving nodes. The setting where nodes are partitioned into subsets, each allowing for local recovery, is well understood. In this work we consider a generalization introduced by Gopalan et al., where, viewing the codewords as arrays, constraints are imposed on the columns and rows in addition to some global constraints. Specifically, we present a generic method of adding such global parity-checks and derive new results on the set of correctable erasure patterns. Finally, we relate the set of correctable erasure patterns in the considered topology to those correctable in tensor-product codes.
Original languageEnglish
Title of host publicationProceedings of 2021 IEEE International Symposium on Information Theory
PublisherIEEE
Publication date2021
Pages2054-2059
ISBN (Print)9781538682098
DOIs
Publication statusPublished - 2021
Event2021 IEEE International Symposium on Information Theory - Virtual event, Melbourne, Australia
Duration: 12 Jul 202120 Jul 2021

Conference

Conference2021 IEEE International Symposium on Information Theory
LocationVirtual event
Country/TerritoryAustralia
CityMelbourne
Period12/07/202120/07/2021
SeriesIEEE International Symposium on Information Theory - Proceedings
ISSN2157-8095

Fingerprint

Dive into the research topics of 'Correctable Erasure Patterns in Product Topologies'. Together they form a unique fingerprint.

Cite this