PROJECT TITLE :

A Framework of Constructions of Minimal Storage Regenerating Codes With the Optimal Access/Update Property

ABSTRACT:

During this paper, we gift a generic framework for constructing systematic minimum storage regenerating codes with two parity nodes primarily based on the invariant subspace technique. Codes constructed in our framework not only contain some best known codes as special cases, however conjointly embrace some new codes with key properties, like the optimal access property and also the optimal update property. In particular, for a given storage capacity of an individual node, one of the new codes has the largest range of systematic nodes and two of the new codes have the biggest number of systematic nodes with the optimal update property.