A New Construction of $(k+2,k)$ Minimal Storage Regenerating Code Over F3 With Optimal Access Property for All Nodes

The optimal access property is highly desirable for distributed storage systems. In this letter, based on the (k+2,k) zigzag code, we propose a new (k+2,k) minimal storage regenerating code. The new code inherits the key properties of the zigzag code, such as the optimal access property for all systematic nodes and small alphabet F
₃
. Furthermore, the new code possesses the optimal access property for the two parity nodes, at the expense of doubled storage per node of the original zigzag code. While possessing the same properties (optimal access property for all nodes and small alphabet F
₃
), the new code requires only half of the storage per node compared with that of the modified zigzag code.