Codes with local regeneration

Kamath, Govinda M and Prakash, N and Lalitha, V and Kumar, Vijay P (2013) Codes with local regeneration. In: 2013 Information Theory and Applications Workshop (ITA), 10-15 Feb. 2013, San Diego, CA.

PDF Inform_Theor_Appli_Work_1_2013.pdf - Published Version Restricted to Registered users only Download (224kB) | Request a copy

Abstract

Regenerating codes and codes with locality are schemes recently proposed for a distributed storage network. While regenerating codes minimize the data downloaded for node repair, codes with locality minimize the number of nodes accessed during repair. In this paper, we provide some constructions of codes with locality, in which the local codes are regenerating codes, thereby combining the advantages of both classes of codes. The proposed constructions achieve an upper bound on minimum distance and are hence optimal. The constructions include both the cases when the local regenerating codes correspond to the MSR point as well as the MBR point on the storage repair-bandwidth tradeoff curve.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright of this article belongs to IEEE.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	16 Aug 2013 09:48
Last Modified:	16 Aug 2013 09:48
URI:	http://eprints.iisc.ac.in/id/eprint/47002

Actions (login required)

View Item