Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 195

The DOI matches its Crossref record.

Simple regenerating codes: Network coding for cloud storage

Open access
Papailiopoulos, Dimitris S., Luo, Jianqiang, Dimakis, Alexandros G., Huang, Cheng, Li, Jin · 2012 · 2012 Proceedings IEEE INFOCOM

Abstract

Network codes designed specifically for distributed storage systems have the potential to provide dramatically higher storage efficiency for the same availability. One main challenge in the design of such codes is the exact repair problem: if a node storing encoded information fails, in order to maintain the same level of reliability we need to create encoded information at a new node. One of the main open problems in this emerging area has been the design of simple coding schemes that allow exact and low cost repair of failed nodes and have high data rates. In particular, all prior known explicit constructions have data rates bounded by 1/2. In this paper we introduce the first family of distributed storage codes that have simple look-up repair and can achieve rates up to 2/3. Our constructions are very simple to implement and perform exact repair by simple XORing of packets. We experimentally evaluate the proposed codes in a realistic cloud storage simulator and show significant benefits in both performance and reliability compared to replication and standard Reed-Solomon codes.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/infcom.2012.6195703

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 195

Metadata

Authors
Papailiopoulos, D. S., Luo, J., Dimakis, A. G., Huang, C., & Li, J.
Venue
2012 Proceedings IEEE INFOCOM
Publisher
IEEE
Published
2012-03
Pages
2801-2805
OpenAlex
W2139703052
Cited by
195
References
0
FWCI
24.51
Type
conference paper
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Simple regenerating codes: Network coding for cloud storage. https://app.cochat.ai/papers/10.1109/infcom.2012.6195703
The paper
Papailiopoulos, D. S., Luo, J., Dimakis, A. G., Huang, C., & Li, J. (2012). Simple regenerating codes: Network coding for cloud storage. 2012 Proceedings IEEE INFOCOM. https://doi.org/10.1109/infcom.2012.6195703

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.