Repair optimal erasure codes through Hadamard designs

Dimitris S. Papailiopoulos, Alexandros G. Dimakis, Viveck R. Cadambe

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

35 Citations (Scopus)

Abstract

In distributed storage systems that employ erasure coding, the issue of minimizing the total communication required to exactly rebuild a storage node after a failure arises. This repair bandwidth depends on the structure of the storage code and the repair strategies used to restore the lost data. Designing high-rate maximum-distance separable (MDS) codes that achieve the optimum repair communication has been a well-known open problem. In this work, we use Hadamard matrices to construct the first explicit 2-parity MDS storage code with optimal repair properties for all single node failures, including the parity nodes. Our construction relies on a novel method of achieving perfect interference alignment over finite fields with a finite file size, or number of symbol extensions.

Original languageEnglish (US)
Title of host publication2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Pages1382-1389
Number of pages8
DOIs
StatePublished - Dec 1 2011
Event2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 - Monticello, IL, United States
Duration: Sep 28 2011Sep 30 2011

Publication series

Name2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

Other

Other2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
CountryUnited States
CityMonticello, IL
Period9/28/119/30/11

Fingerprint

Repair
Hadamard matrices
Communication
Bandwidth

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Papailiopoulos, D. S., Dimakis, A. G., & Cadambe, V. R. (2011). Repair optimal erasure codes through Hadamard designs. In 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 (pp. 1382-1389). [6120328] (2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011). https://doi.org/10.1109/Allerton.2011.6120328
Papailiopoulos, Dimitris S. ; Dimakis, Alexandros G. ; Cadambe, Viveck R. / Repair optimal erasure codes through Hadamard designs. 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011. 2011. pp. 1382-1389 (2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011).
@inproceedings{96dcff2be81140aea2688fda8e06046c,
title = "Repair optimal erasure codes through Hadamard designs",
abstract = "In distributed storage systems that employ erasure coding, the issue of minimizing the total communication required to exactly rebuild a storage node after a failure arises. This repair bandwidth depends on the structure of the storage code and the repair strategies used to restore the lost data. Designing high-rate maximum-distance separable (MDS) codes that achieve the optimum repair communication has been a well-known open problem. In this work, we use Hadamard matrices to construct the first explicit 2-parity MDS storage code with optimal repair properties for all single node failures, including the parity nodes. Our construction relies on a novel method of achieving perfect interference alignment over finite fields with a finite file size, or number of symbol extensions.",
author = "Papailiopoulos, {Dimitris S.} and Dimakis, {Alexandros G.} and Cadambe, {Viveck R.}",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/Allerton.2011.6120328",
language = "English (US)",
isbn = "9781457718168",
series = "2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011",
pages = "1382--1389",
booktitle = "2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011",

}

Papailiopoulos, DS, Dimakis, AG & Cadambe, VR 2011, Repair optimal erasure codes through Hadamard designs. in 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011., 6120328, 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, pp. 1382-1389, 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, Monticello, IL, United States, 9/28/11. https://doi.org/10.1109/Allerton.2011.6120328

Repair optimal erasure codes through Hadamard designs. / Papailiopoulos, Dimitris S.; Dimakis, Alexandros G.; Cadambe, Viveck R.

2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011. 2011. p. 1382-1389 6120328 (2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011).

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

TY - GEN

T1 - Repair optimal erasure codes through Hadamard designs

AU - Papailiopoulos, Dimitris S.

AU - Dimakis, Alexandros G.

AU - Cadambe, Viveck R.

PY - 2011/12/1

Y1 - 2011/12/1

N2 - In distributed storage systems that employ erasure coding, the issue of minimizing the total communication required to exactly rebuild a storage node after a failure arises. This repair bandwidth depends on the structure of the storage code and the repair strategies used to restore the lost data. Designing high-rate maximum-distance separable (MDS) codes that achieve the optimum repair communication has been a well-known open problem. In this work, we use Hadamard matrices to construct the first explicit 2-parity MDS storage code with optimal repair properties for all single node failures, including the parity nodes. Our construction relies on a novel method of achieving perfect interference alignment over finite fields with a finite file size, or number of symbol extensions.

AB - In distributed storage systems that employ erasure coding, the issue of minimizing the total communication required to exactly rebuild a storage node after a failure arises. This repair bandwidth depends on the structure of the storage code and the repair strategies used to restore the lost data. Designing high-rate maximum-distance separable (MDS) codes that achieve the optimum repair communication has been a well-known open problem. In this work, we use Hadamard matrices to construct the first explicit 2-parity MDS storage code with optimal repair properties for all single node failures, including the parity nodes. Our construction relies on a novel method of achieving perfect interference alignment over finite fields with a finite file size, or number of symbol extensions.

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

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

U2 - 10.1109/Allerton.2011.6120328

DO - 10.1109/Allerton.2011.6120328

M3 - Conference contribution

AN - SCOPUS:84856083898

SN - 9781457718168

T3 - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

SP - 1382

EP - 1389

BT - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

ER -

Papailiopoulos DS, Dimakis AG, Cadambe VR. Repair optimal erasure codes through Hadamard designs. In 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011. 2011. p. 1382-1389. 6120328. (2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011). https://doi.org/10.1109/Allerton.2011.6120328