Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes
arXiv:1610.08026
Abstract
In this paper, we revisit the problem of finding the longest systematic-length for a linear minimum storage regenerating (MSR) code with optimal repair of only systematic part, for a given per-node storage capacity and an arbitrary number of parity nodes . We study the problem by following a geometric analysis of linear subspaces and operators. First, a simple quadratic bound is given, which implies that is the largest number of systematic nodes in the \emph{scalar} scenario. Second, an -based-log bound is derived, which is superior to the upper bound on log-base in the prior work. Finally, an explicit upper bound depending on the value of is introduced, which further extends the corresponding result in the literature.
References in corpus (7)
- 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
- Optimal Repair of MDS Codes in Distributed Storage via Subspace Interference Alignment
- On Codes for Optimal Rebuilding Access
- Regenerating Codes for Errors and Erasures in Distributed Storage
- Minimum Storage Regenerating Codes For All Parameters
- A High-Rate MSR Code With Polynomial Sub-Packetization Level