paper

The Storage-Repair-Bandwidth Trade-off of Exact Repair Linear Regenerating Codes for the Case

arXiv:1501.03983

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 , where 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 . The new outer bound is derived by analyzing the dual code of the linear regenerating code.

arXiv commentCorrected typos, minor editing for better readability

References in corpus (4)

Cited by in corpus (1)