Computer Science – Information Theory
Scientific paper
2012-02-11
Computer Science
Information Theory
13 pages, Shorter version submitted to ISIT 2012
Scientific paper
Motivated by applications to distributed storage, Gopalan \textit{et al} recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check equation associated with small Hamming weight, thereby enabling recovery of the message symbol by examining a small number of other code symbols. This notion is expanded to the case when all code symbols, not just the message symbols, are covered by such "local" parity. In this paper, we extend the results of Gopalan et. al. so as to permit recovery of an erased code symbol even in the presence of errors in local parity symbols. We present tight bounds on the minimum distance of such codes and exhibit codes that are optimal with respect to the local error-correction property. As a corollary, we obtain an upper bound on the minimum distance of a concatenated code.
Kamath Govinda M.
Kumar Vijay P.
Lalitha V.
Prakash Nupur
No associations
LandOfFree
Optimal Linear Codes with a Local-Error-Correction Property 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 Optimal Linear Codes with a Local-Error-Correction Property, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Linear Codes with a Local-Error-Correction Property will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-237876