A Family of Erasure Correcting Codes with Low Repair Bandwidth and Low Repair Complexity
Paper i proceeding, 2015

We present the construction of a new family of erasure correcting codes for distributed storage that yield low repair bandwidth and low repair complexity. The construction is based on two classes of parity symbols. The primary goal of the first class of symbols is to provide good erasure correcting capability, while the second class facilitates node repair, reducing the repair bandwidth and the repair complexity. We compare the proposed codes with other codes proposed in the literature.

Författare

Siddhartha Kumar

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Alexandre Graell i Amat

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Iryna Andriyanova

Fredrik Brännström

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

IEEE Global Communications Conference (GLOBECOM), San Diego, CA, DEC 06-10, 2015

Styrkeområden

Informations- och kommunikationsteknik

Drivkrafter

Hållbar utveckling

Ämneskategorier

Telekommunikation

DOI

10.1109/GLOCOM.2015.7417790

ISBN

978-1-4799-5952-5