2018 IEEE Information Theory Workshop (ITW) 2018
DOI: 10.1109/itw.2018.8613529
|View full text |Cite
|
Sign up to set email alerts
|

Capacity of Locally Recoverable Codes

Abstract: Motivated by applications in distributed storage, the notion of a locally recoverable code (LRC) was introduced a few years back. In an LRC, any coordinate of a codeword is recoverable by accessing only a small number of other coordinates. While different properties of LRCs have been well-studied, their performance on channels with random erasures or errors has been mostly unexplored. In this note, we analyze the performance of LRCs over such stochastic channels. In particular, for input-symmetric discrete mem… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 19 publications
0
1
0
Order By: Relevance
“…Another class of codes, called local codes [42]- [51], focuses on the locality of codeword symbols during repair, that is, the number of nodes that need to be accessed when repairing a single failure. Local codes improve repair and degraded read performance, since missing information can be recovered without having to recover the full data.…”
Section: Related Workmentioning
confidence: 99%
“…Another class of codes, called local codes [42]- [51], focuses on the locality of codeword symbols during repair, that is, the number of nodes that need to be accessed when repairing a single failure. Local codes improve repair and degraded read performance, since missing information can be recovered without having to recover the full data.…”
Section: Related Workmentioning
confidence: 99%