The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Decentralized erasure codes for distributed networked storage
Open accessAbstract
In this correspondence, we consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes with limited memory and k
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
Ahlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850663 · Cited by 7,814
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Noiseless coding of correlated information sources
Slepian, D., & Wolf, J. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055037 · Cited by 3,952
Bollobás, B. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0619-4 · Cited by 3,772
Li, S.-Y. R., Yeung, R. W., & Cai, N. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.807285 · Cited by 3,378
Luby, M. (2003) · The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. · doi:10.1109/sfcs.2002.1181950 · Cited by 2,757
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
A Random Linear Network Coding Approach to Multicast
Ho, T., Medard, M., Koetter, R., Karger, D. R., Effros, M., Shi, J., & Leong, B. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.881746 · Cited by 2,553
An algebraic approach to network coding
Koetter, R., & Medard, M. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818197 · Cited by 2,356
Shokrollahi, A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874390 · Cited by 2,154
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
Efficient dispersal of information for security, load balancing, and fault tolerance
Rabin, M. O. (1989) · Journal of the ACM · doi:10.1145/62044.62050 · Cited by 1,365
Shokrollahi, A. (2007) · Cited by 1,256
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · Proceedings of the ninth international conference on Architectural support for programming languages and operating systems · doi:10.1145/378993.379239 · Cited by 869
Solving sparse linear equations over finite fields
Wiedemann, D. (1986) · IEEE Transactions on Information Theory · doi:10.1109/tit.1986.1057137 · Cited by 546
“Balls into Bins” — A Simple and Tight Analysis
Raab, M., & Steger, A. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49543-6_13 · Cited by 455
Dimakis, A. G., Prabhakaran, V. M., & Ramchandran, K. (2005) · doi:10.5555/1147685.1147708 · Cited by 164
Self-citationБалакин, Г. В. (1967) · Theory of Probability and Its Applications · doi:10.1137/1112034 · Cited by 114
Dimakis, A. G., Prabhakaran, V. M., & Ramchandran, K. (2005) · International Symposium on Information Processing in Sensor Networks (IPSN) · doi:10.1109/ipsn.2005.1440909 · Cited by 101
Self-citationSeparating distributed source coding from network coding
Ramamoorthy, A., Jain, K. K., Chou, P. A., & Effros, M. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874534 · Cited by 94
Distributed data storage in sensor networks using decentralized erasure codes
Dimakis, A. G., Prabhakaran, V. M., & Ramchandran, K. (2005) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/acssc.2004.1399381 · Cited by 24
Self-citationBollobás, B. (1979) · Graduate texts in mathematics · doi:10.1007/978-1-4612-9967-7_7 · Cited by 17
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
Self-citation
Metadata
- Authors
- Dimakis, A. G., Prabhakaran, V., & Ramchandran, K.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2006-06
- Volume
- 52
- Issue
- 6
- Pages
- 2809-2816
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W1966612101
- Cited by
- 253
- References
- 22
- FWCI
- 19.66
- 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.
