Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes

DOI10.1109/TIT.2018.2880239MaRDI QIDQ4615356zbMATH OpenOpenAlexWikidataFDO

Authors Kun Huang, Udaya Parampalli, Ming Xian

Publication date 28 January 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.08026

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Abstract: In this paper, we revisit the problem of finding the longest systematic-length $k$ for a linear minimum storage regenerating (MSR) code with optimal repair of only systematic part, for a given per-node storage capacity $l$ and an arbitrary number of parity nodes $r$. We study the problem by following a geometric analysis of linear subspaces and operators. First, a simple quadratic bound is given, which implies that $k=r+2$ is the largest number of systematic nodes in the emph{scalar} scenario. Second, an $r$-based-log bound is derived, which is superior to the upper bound on log-base $2$ in the prior work. Finally, an explicit upper bound depending on the value of $frac{r}^{2}l$ is introduced, which further extends the corresponding result in the literature.

Cited in

(2)

• An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes
• Codes for Distributed Storage

This page was built for publication: Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4615356)