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)
- Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
- Characterizing the Rate Region of the (4,3,3) Exact-Repair Regenerating Codes
- Layered, Exact-Repair Regenerating Codes Via Embedded Error Correction and Block Designs