Name
Abstract | ||
|---|---|---|
In this letter, we revisit the Hadamard minimum storage regenerating code to form a new minimum storage regenerating code. The resultant new code has two more systematic nodes than that of the Hadamard minimum storage regenerating code with the same node capacity. Furthermore, we present simple but efficient repair strategies for all the systematic nodes of the new code. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/LCOMM.2016.2518671 | Communications Letters, IEEE |
Keywords | Field | DocType |
Systematics,Maintenance engineering,Error correction,Error correction codes,Peer-to-peer computing,Encoding,Silicon | Constant-weight code,Systematic code,Computer science,Polynomial code,Cyclic code,Algorithm,Error detection and correction,Linear code,Hadamard code,Hadamard transform | Journal |
Volume | Issue | ISSN |
PP | 99 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sina Zhang | 1 | 0 | 0.34 |
| Jie Li | 2 | 48 | 6.35 |
| Xiaohu Tang | 3 | 1294 | 121.15 |