A Family of Erasure Correcting Codes with Low Repair Bandwidth and Low Repair Complexity
Paper in proceedings, 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.

Author

Siddhartha Kumar

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Alexandre Graell i Amat

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Iryna Andriyanova

Fredrik Brännström

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

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

Areas of Advance

Information and Communication Technology

Driving Forces

Sustainable development

Subject Categories

Telecommunications

DOI

10.1109/GLOCOM.2015.7417790

ISBN

978-1-4799-5952-5

More information

Created

10/7/2017