The DOI matches its OpenAlex record.
WEAVER codes: highly fault tolerant erasure codes for storage systems
Abstract
We present the WEAVER codes, new families of simple highly fault tolerant XOR-based erasure codes for storage systems (with fault tolerance up to 12). The design features of WEAVER codes are (a) placement of data and parity blocks on the same strip, (b) constrained parity in-degree and (c) balance and symmetry. These codes are in general not maximum distance separable (MDS) but have optimal storage efficiency among all codes with constrained parity in-degree. Though applicable to RAID controller systems, the WEAVER codes are probably best suited in dRAID systems (distributed Redundant Arrangement of Independent Devices). We discuss the advantages these codes have over many other erasure codes for storage systems.
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
Cited by
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
Huang, C., Chen, M., & Li, J. (2007) · Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) · doi:10.1109/nca.2007.37 · Cited by 298
An analysis of data corruption in the storage stack
Bairavasundaram, L. N., Arpaci-Dusseau, A. C., Arpaci-Dusseau, R. H., Goodson, G. R., & Schroeder, B. (2008) · ACM Transactions on Storage · doi:10.1145/1416944.1416947 · Cited by 282
Understanding latent sector errors and how to protect against them
Schroeder, B., Damouras, S., & Gill, P. (2010) · ACM Transactions on Storage · doi:10.1145/1837915.1837917 · Cited by 131
Metadata
- Authors
- Hafner, J. L.
- Venue
- File and Storage Technologies
- Published
- 2005-12-13
- Pages
- 16-16
- DOI
- 10.5555/1251028.1251044
- OpenAlex
- W2147527217
- Cited by
- 186
- References
- 0
- FWCI
- 15.24
- Type
- journal article
- Language
- en
- Open access
- closed
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: WEAVER codes: highly fault tolerant erasure codes for storage systems. https://app.cochat.ai/papers/10.5555/1251028.1251044
- The paper
- Hafner, J. L. (2005). WEAVER codes: highly fault tolerant erasure codes for storage systems. File and Storage Technologies. https://doi.org/10.5555/1251028.1251044
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.