A new construction of (k+2, k) minimal storage regenerating code over F-3 with optimal access property for all nodes

Li, Jie, Tang, Xiaohu, and Xiang, Wei (2016) A new construction of (k+2, k) minimal storage regenerating code over F-3 with optimal access property for all nodes. IEEE Communications Letters, 20 (7). pp. 1289-1292.

PDF (Published Version) - Published Version
Restricted to Repository staff only

DOI: 10.1109/LCOMM.2016.2564382

View at Publisher Website: http://dx.doi.org/10.1109/LCOMM.2016.256...

Abstract

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-3. 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-3), the new code requires only half of the storage per node compared with that of the modified zigzag code.


Item ID:	46398
Item Type:	Article (Research - C1)
ISSN:	1558-2558
Keywords:	distributed storage, high rate, MSR code, optimal access, optimal repair
Related URLs:	Publisher
Funders:	National Science Foundation of China (NSFC), National High Technology Research and Development Program of China (NHTRDP), Major Frontier Project of Sichuan Province (MFPSP)
Projects and Grants:	NSFC 61325005, NHTRDP 2015AA01A705, MFPSP 2015JY0282
Date Deposited:	09 Nov 2016 07:50
FoR Codes:	40 ENGINEERING > 4006 Communications engineering > 400602 Data communications @ 100%
SEO Codes:	89 INFORMATION AND COMMUNICATION SERVICES > 8901 Communication Networks and Services > 890103 Mobile Data Networks and Services @ 100%
	More Statistics

Actions (Repository Staff Only)

Item Control Page