Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes
Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes
复制标题
精确修复再生代码的存储修复带宽权衡的外部界限
DOI：
--
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
P. V. Kumar
中科院分区：
文献类型：
--
作者：
B. Sasidharan;N. Prakash;M. Krishnan;Myna Vajha;Kaushik Senthoor;P. V. Kumar
本文给出了参数集为${（n，k，d），（alpha，eta）}$下的精确修复（ER）设置。第一个外边界适用于每个参数集$（n，k，d）$，并且结合称为{em改进的分层码}的码构造，它表征了针对情况$（n，k=3，d=n-1）$的归一化ER折衷。它为每个$（n，k，d）$建立了ER和功能修复（FR）权衡之间的非零差距。第二个边界是对Mohajer等人的现有边界的改进，并且在远离最小存储再生（MSR）点的区域中比第一个边界更紧。第三个界限是针对k=d的情况，在线性设置下。该外边界与{em分层码}的可实现区域匹配，从而表征当k=d=n-1时线性ER码的归一化ER折衷。
In this paper, three outer bounds on the normalized storage-repair bandwidth (S-RB) tradeoff of regenerating codes having parameter set ${(n,k,d),(alpha,eta)}$ under the exact-repair (ER) setting are presented. The first outer bound is applicable for every parameter set $(n,k,d)$ and in conjunction with a code construction known as {em improved layered codes}, it characterizes the normalized ER tradeoff for the case $(n,k=3,d=n-1)$. It establishes a non-vanishing gap between the ER and functional-repair (FR) tradeoffs for every $(n,k,d)$. The second bound is an improvement upon an existing bound due to Mohajer et al. and is tighter than the first bound, in a regime away from the Minimum Storage Regeneraing (MSR) point. The third bound is for the case of $k=d$, under the linear setting. This outer bound matches with the achievable region of {em layered codes} thereby characterizing the normalized ER tradeoff of linear ER codes when $k=d=n-1$.