Name
Title | ||
|---|---|---|
A New Construction of $(k+2,k)$ Minimal Storage Regenerating Code Over F 3 With Optimal Access Property for All Nodes |
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/LCOMM.2016.2564382 | IEEE Communications Letters |
Keywords | Field | DocType |
Maintenance engineering,Systematics,Bandwidth,Encoding,Distributed databases,Error correction,Electronic mail | Discrete mathematics,Code rate,Computer science,Distributed data store,Algorithm,Computer network,Error detection and correction,Bandwidth (signal processing),Distributed database,Universal code,Zigzag code,Encoding (memory) | Journal |
Volume | Issue | ISSN |
20 | 7 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jie Li | 1 | 48 | 6.35 |
| Xiaohu Tang | 2 | 1294 | 121.15 |
| Wei Xiang | 3 | 630 | 78.60 |