Name
Title | ||
|---|---|---|
Explicit Constructions of High-Rate MSR Codes With Optimal Access Property Over Small Finite Fields. |
Abstract | ||
|---|---|---|
Up to now, many (k + r, k, N) minimum-storage regenerating (MSR) codes with k information nodes, r parity nodes, and node capacity N have been proposed. However, most of them are constructed over a relatively large finite field. In this paper, we propose three high-rate MSR codes over small finite fields. First, the new MSR code C1 with the optimal access property for all nodes is constructed over... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TCOMM.2018.2836445 | IEEE Transactions on Communications |
Keywords | Field | DocType |
Peer-to-peer computing,Maintenance engineering,Bandwidth,Redundancy,Electronic mail,Galois fields | Finite field,Combinatorics,Computer science,Control theory,Peer to peer computing | Journal |
Volume | Issue | ISSN |
66 | 10 | 0090-6778 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yi Liu | 1 | 0 | 0.68 |
| Jie Li | 2 | 48 | 6.35 |
| Xiaohu Tang | 3 | 1294 | 121.15 |