The DOI matches its Crossref record.
Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems
Abstract
To flexibly explore the trade-offs between storage space and access efficiency in reliable data storage systems, we describe two classes of erasure resilient coding schemes: basic and generalized pyramid codes. The basic pyramid codes can be simply derived from any existing codes, and thus all known efficient encoding/decoding techniques directly apply. The generalized pyramid codes are radically advanced new codes, which can further improve access efficiency and/or reliability upon the basic pyramid codes. We also establish a necessary condition for any failure pattern to be ever recoverable, and show that the generalized pyramid codes are optimal in failure recovery (i.e., the necessary condition is also sufficient, and any failure pattern that is ever recoverable can indeed be recovered).
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
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
Optimal linear codes with a local-error-correction property
Prakash, N., Kamath, G. M., Lalitha, V., & Kumar, P. V. (2012) · 2012 IEEE International Symposium on Information Theory Proceedings · doi:10.1109/isit.2012.6284028 · Cited by 295
Metadata
- Authors
- Huang, C., Chen, M., & Li, J.
- Venue
- Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)
- Publisher
- IEEE
- Published
- 2007-07
- Pages
- 79-86
- OpenAlex
- W2099837838
- Cited by
- 298
- References
- 0
- FWCI
- 5.34
- Type
- conference paper
- 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: Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems. https://app.cochat.ai/papers/10.1109/nca.2007.37
- The paper
- Huang, C., Chen, M., & Li, J. (2007). Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems. Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007). https://doi.org/10.1109/nca.2007.37
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.
