The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
On the Locality of Codeword Symbols
Abstract
Consider a linear [n,k,d]qcodeC. We say that theith coordinate ofChas localityr, if the value at this coordinate can be recovered from accessing some otherrcoordinates ofC. Data storage applications require codes with small redundancy, low locality for information coordinates, large distance, and low locality for parity coordinates. In this paper, we carry out an in-depth study of the relations between these parameters. We establish a tight bound for the redundancyn-kin terms of the message length, the distance, and the locality of information coordinates. We refer to codes attaining the bound as optimal. We prove some structure theorems about optimal codes, which are particularly strong for small distances. This gives a fairly complete picture of the tradeoffs between codewords length, worst case distance, and locality of information symbols. We then consider the locality of parity check symbols and erasure correction beyond worst case distance for optimal codes. Using our structure theorem, we obtain a tight bound for the locality of parity symbols possible in such codes for a broad class of parameter settings. We prove that there is a tradeoff between having good locality and the ability to correct erasures beyond the minimum distance.
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
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
Erasure coding in windows azure storage
Huang, C., Simitci, H., Xu, Y., Ogus, A., Calder, B., Gopalan, P., Li, J., & Yekhanin, S. (2012) · Cited by 928
Self-citationRashmi, K. V., Shah, N. B., & Kumar, P. V. (2011) · NOT FOUND REPOSITORY (Indian Institute of Science Bangalore) · Cited by 701
A Survey on Network Codes for Distributed Storage
Dimakis, A. G., Ramchandran, K., Wu, Y., et al. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2096170 · Cited by 639
Rashmi, K. V., Shah, N. B., & Kumar, P. V. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2159049 · Cited by 588
Towards 3-query locally decodable codes of subexponential length
Yekhanin, S. (2008) · Journal of the ACM · doi:10.1145/1326554.1326555 · Cited by 440
Self-citationHuang, 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
Self-citationAlgebraic Geometric Codes: Basic Notions
Tsfasman, M., Vlǎduţ, S., & Nogin, D. (2007) · Mathematical Surveys and Monographs · doi:10.1090/surv/139 · Cited by 270
On the efficiency of local decoding procedures for error-correcting codes
Katz, J., & Trevisan, L. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing · doi:10.1145/335305.335315 · Cited by 264
3-Query Locally Decodable Codes of Subexponential Length
Efremenko, K. (2012) · SIAM Journal on Computing · doi:10.1137/090772721 · Cited by 256
Cited by
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
The Capacity of Private Information Retrieval
Sun, H., & Jafar, S. A. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2689028 · Cited by 447
The Capacity of Robust Private Information Retrieval With Colluding Databases
Sun, H., & Jafar, S. A. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2777490 · Cited by 312
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
SoK of used cryptography in blockchain
Raikwar, M., Gligoroski, D., & Kralevska, K. (2019) · IEEE Access · doi:10.1109/access.2019.2946983 · Cited by 153
Metadata
- Authors
- Gopalan, P., Huang, C., Simitci, H., & Yekhanin, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2012-11
- Volume
- 58
- Issue
- 11
- Pages
- 6925-6934
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W1993830711
- Cited by
- 831
- References
- 13
- FWCI
- 43.38
- 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
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.