The Storage-Repair-Bandwidth Trade-off of Exact Repair Linear Regenerating Codes for the Case d = k = n-1

Prakash, N and Krishnan, Nikhil M (2015) The Storage-Repair-Bandwidth Trade-off of Exact Repair Linear Regenerating Codes for the Case d = k = n-1. In: IEEE International Symposium on Information Theory (ISIT), JUN 14-19, 2015, Hong Kong, PEOPLES R CHINA, pp. 859-863.

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

Abstract

In this paper, we consider the setting of exact repair linear regenerating codes. Under this setting, we derive a new outer bound on the storage-repair-bandwidth trade-off for the case when d = k = n - 1, where (n; k; d) are parameters of the regenerating code, with their usual meaning. Taken together with the achievability result of Tian et. al. 1], we show that the new outer bound derived here completely characterizes the trade-off for the case of exact repair linear regenerating codes, when d = k = n - 1. The new outer bound is derived by analyzing the dual code of the linear regenerating code.

Item Type:	Conference Paper
Series.:	IEEE International Symposium on Information Theory
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	07 Dec 2016 05:29
Last Modified:	07 Dec 2016 05:29
URI:	http://eprints.iisc.ac.in/id/eprint/55507

Actions (login required)

View Item