Name
Abstract | ||
|---|---|---|
In distributed storage systems, regenerating codes can achieve the optimal tradeoff between storage capacity and repair bandwidth. However, a critical drawback of existing regenerating codes, in general, is the high coding and repair complexity, since the coding and repair processes involve expensive multiplication operations in finite field. In this paper, we present a design framework of regener... |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/TIT.2016.2553670 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Maintenance engineering,Encoding,Bandwidth,Computational complexity,Parity check codes,Decoding | Discrete mathematics,Concatenated error correction code,Computer science,Fountain code,Parallel computing,Serial concatenated convolutional codes,Turbo code,Block code,Algorithm,Linear code,Reed–Muller code,Tornado code | Journal |
Volume | Issue | ISSN |
62 | 6 | 0018-9448 |
Citations | PageRank | References |
8 | 0.51 | 20 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hou Hanxu | 1 | 83 | 14.46 |
| Kenneth W. Shum | 2 | 87 | 7.09 |
| Minghua Chen | 3 | 1049 | 68.89 |
| Li Hui | 4 | 173 | 34.14 |