High-Rate Regenerating Codes through Layering

Sasidharan, Birenjith and Kumar, Vijay P (2013) High-Rate Regenerating Codes through Layering. In: IEEE International Symposium on Information Theory Proceedings (ISIT), JUL 07-12, 2013, Istanbul, TURKEY, pp. 1611-1615.

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

Abstract

In this paper, we provide explicit constructions for a class of exact-repair regenerating codes that possess a layered structure. These regenerating codes correspond to interior points on the storage-repair-bandwidth tradeoff where the cut-set bound of network coding is known to be not achievable under exact repair. The codes presented in this paper compare very well in comparison to schemes that employ space-sharing between MSR and MBR points, and come closest of all-known explicit constructions to interior points of the tradeoff. The codes can be constructed for a wide range of parameters, are high-rate, can repair multiple nodes simultaneously and no computation at helper nodes is required to repair a failed node. We also construct optimal codes with locality in which the local codes are layered regenerating codes.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Additional Information:	Copy right for this article belongs to the IEEE International Symposium on Information Theory Proceedings (ISIT), Istanbul, TURKEY, JUL 07-12, 2013
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	23 Aug 2016 10:39
Last Modified:	23 Aug 2016 10:39
URI:	http://eprints.iisc.ac.in/id/eprint/54448

Actions (login required)

View Item