New Codes and Inner Bounds for Exact Repair in Distributed Storage Systems

TL;DR

This paper investigates the tradeoff between storage capacity and repair bandwidth in distributed storage systems, proposing new bounds and code constructions that achieve optimal performance.

Contribution

It introduces new inner bounds for the exact-repair tradeoff region and provides code constructions that attain these bounds, advancing the understanding of efficient distributed storage.

Findings

New inner bounds for the exact-repair tradeoff region.

Code constructions that achieve the proposed bounds.

Abstract

We study the exact-repair tradeoff between storage and repair bandwidth in distributed storage systems (DSS). We give new inner bounds for the tradeoff region and provide code constructions that achieve these bounds.