ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Codes With Local Regeneration and Erasure Correction

Kamath, Govinda M and Prakash, N and Lalitha, V and Kumar, Vijay P (2014) Codes With Local Regeneration and Erasure Correction. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 60 (8). pp. 4637-4660.

[img] PDF
ieee_tra_inf_the_60-8_4637_2014.pdf - Published Version
Restricted to Registered users only

Download (1MB) | Request a copy
Official URL: http://dx.doi.org/ 10.1109/TIT.2014.2329872


Regenerating codes and codes with locality are two coding schemes that have recently been proposed, which in addition to ensuring data collection and reliability, also enable efficient node repair. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. This paper presents results in two directions. In one, this paper extends the notion of codes with locality so as to permit local recovery of an erased code symbol even in the presence of multiple erasures, by employing local codes having minimum distance >2. An upper bound on the minimum distance of such codes is presented and codes that are optimal with respect to this bound are constructed. The second direction seeks to build codes that combine the advantages of both codes with locality as well as regenerating codes. These codes, termed here as codes with local regeneration, are codes with locality over a vector alphabet, in which the local codes themselves are regenerating codes. We derive an upper bound on the minimum distance of vector-alphabet codes with locality for the case when their constituent local codes have a certain uniform rank accumulation property. This property is possessed by both minimum storage regeneration (MSR) and minimum bandwidth regeneration (MBR) codes. We provide several constructions of codes with local regeneration which achieve this bound, where the local codes are either MSR or MBR codes. Also included in this paper, is an upper bound on the minimum distance of a general vector code with locality as well as the performance comparison of various code constructions of fixed block length and minimum distance.

Item Type: Journal Article
Additional Information: Copy right for this article belongs to the IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 445 HOES LANE, PISCATAWAY, NJ 08855-4141 USA
Keywords: Codes with local regeneration; codes with locality; concatenated codes; distributed storage; locally repairable codes; minimum distance bound; node repair; pyramid codes; regenerating codes; uniform rank accumulation; vector codes
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 04 Sep 2014 11:04
Last Modified: 04 Sep 2014 11:04
URI: http://eprints.iisc.ac.in/id/eprint/49763

Actions (login required)

View Item View Item