Computer Science – Information Theory
Scientific paper
2011-06-18
Computer Science
Information Theory
Scientific paper
Consider a linear [n,k,d]_q code C. We say that that i-th coordinate of C has locality r, if the value at this coordinate can be recovered from accessing some other r coordinates of C. 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 redundancy n-k in 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 for parity checks and the ability to correct erasures beyond the minimum distance.
Gopalan Parikshit
Huang Cheng
Simitci Huseyin
Yekhanin Sergey
No associations
LandOfFree
On the Locality of Codeword Symbols does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Locality of Codeword Symbols, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Locality of Codeword Symbols will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-465446