The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
Open accessAbstract
Regenerating codes are a class of distributed storage codes that allow for efficient repair of failed nodes, as compared to traditional erasure codes. An$[n, k, d]$regenerating code permits the data to be recovered by connecting to any$k$of the$n$nodes in the network, while requiring that a failed node be repaired by connecting to any$d$nodes. The amount of data downloaded for repair is typically much smaller than the size of the source data. Previous constructions of exact-regenerating codes have been confined to the case$n=d+1$. In this paper, we present optimal, explicit constructions of (a) Minimum Bandwidth Regenerating (MBR) codes for all values of$[n, k, d]$and (b) Minimum Storage Regenerating (MSR) codes for all$[n, k, d\geq 2k-2]$, using a new product-matrix framework. The product-matrix framework is also shown to significantly simplify system operation. To the best of our knowledge, these are the first constructions of exact-regenerating codes that allow the number$n$of nodes in the network, to be chosen independent of the other parameters. The paper also contains a simpler description, in the product-matrix framework, of a previously constructed MSR code with$[n=d+1, k, d\geq 2k-1]$.
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.
Integrity signals
Registry
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.
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
Cites
Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel
Cadambe, V. R., & Jafar, S. A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.926344 · Cited by 2,970
Network Coding for Distributed Storage Systems
Dimakis, A. G., Godfrey, P. B., Wu, Y., Wainwright, M. J., & Ramchandran, K. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054295 · Cited by 1,914
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · Proceedings of the 1988 ACM SIGMOD international conference on Management of data - SIGMOD '88 · doi:10.1145/50202.50214 · Cited by 1,443
Communication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis
Maddah-Ali, M. A., Motahari, A. S., & Khandani, A. K. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.926460 · Cited by 1,008
Cited by
On the Locality of Codeword Symbols
Gopalan, P., Huang, C., Simitci, H., & Yekhanin, S. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2208937 · Cited by 831
Speeding Up Distributed Machine Learning Using Codes
Lee, K., Lam, M., Pedarsani, R., Papailiopoulos, D., & Ramchandran, K. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2736066 · Cited by 829
Metadata
- Authors
- Rashmi, K. V., Shah, N. B., & Kumar, P. V.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2011-08
- Volume
- 57
- Issue
- 8
- Pages
- 5227-5239
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2150777202
- Cited by
- 588
- References
- 4
- FWCI
- 53.15
- Type
- journal article
- 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: Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction. https://app.cochat.ai/papers/10.1109/tit.2011.2159049
- The paper
- Rashmi, K. V., Shah, N. B., & Kumar, P. V. (2011). Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2011.2159049
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.