The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Zigzag Codes: MDS Array Codes With Optimal Rebuilding
Open accessAbstract
Maximum distance separable (MDS) array codes are widely used in storage systems to protect data against erasures. We address the rebuilding ratio problem, namely, in the case of erasures, what is the fraction of the remaining information that needs to be accessed in order to rebuild exactly the lost information? It is clear that when the number of erasures equals the maximum number of erasures that an MDS code can correct, then the rebuilding ratio is 1 (access all the remaining information). However, the interesting and more practical case is when the number of erasures is smaller than the erasure correcting capability of the code. For example, consider an MDS code that can correct two erasures: What is the smallest amount of information that one needs to access in order to correct a single erasure? Previous work showed that the rebuilding ratio is bounded between${{1} \over {2}}$and${{3} \over {4}}$; however, the exact value was left as an open problem. In this paper, we solve this open problem and prove that for the case of a single erasure with a two-erasure correcting code, the rebuilding ratio is${{1} \over {2}}$. In general, we construct a new family of$r$-erasure correcting MDS array codes that has optimal rebuilding ratio of${{1} \over {r}}$in the case of a single erasure. Our array codes have efficient encoding and decoding algorithms (for the cases$r=2$and$r=3$, they use a finite field of size 3 and 4, respectively) and an optimal update property.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Hall, P. (1935) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-10.37.26 · Cited by 1,954
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
EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
Blaum, M., Brady, J., Bruck, J., & Menon, J. (1995) · IEEE Transactions on Computers · doi:10.1109/12.364531 · Cited by 689
Self-citationAlon, N. (1999) · Combinatorics Probability Computing · doi:10.1017/s0963548398003411 · Cited by 653
X-code: MDS array codes with optimal encoding
Xu, L., & Bruck, J. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.746809 · Cited by 398
Self-citationSTAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures
Huang, C., & Xu, L. (2008) · IEEE Transactions on Computers · doi:10.1109/tc.2007.70830 · Cited by 257
Repair optimal erasure codes through hadamard designs
Papailiopoulos, D., Dimakis, A. G., & Cadambe, V. R. (2011) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2011.6120328 · Cited by 84
Cited by
An improved P2P file system scheme based on IPFS and Blockchain
Chen, Y., Li, H., Li, K., & Zhang, J. (2017) · 2017 IEEE International Conference on Big Data (Big Data) · doi:10.1109/bigdata.2017.8258226 · Cited by 238
Metadata
- Authors
- Tamo, I., Wang, Z., & Bruck, J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2013-03
- Volume
- 59
- Issue
- 3
- Pages
- 1597-1616
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2069026918
- Cited by
- 312
- References
- 7
- FWCI
- 25.74
- 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
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.