Name
Abstract | ||
|---|---|---|
This paper proposes a novel recovery scheme for the XOR-based storage codes with the increasing-difference property. For a message of kL bits stored in n storage nodes, a data collector connects any k out of the n storage nodes to recover the message. In our scheme, the data collector acquires exactly L bits for each node, so that no transmission overhead exists. Furthermore, we propose an in-place decoding algorithm that acquires less auxiliary space than the existing decoding algorithm, and the decoding computational complexity of our decoding algorithm is the same as the existing decoding algorithm. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TrustCom.2014.70 | TrustCom |
Keywords | Field | DocType |
in-place decoding algorithm,decoding computational complexity,in-place decoding,data collector,overhead-free in-place recovery scheme,bitwise exclusive-or,increasing-difference property,distributed storage system, maximum distance separable code, recovery scheme, in-place decoding,maximum distance separable code,computational complexity,xor-based storage codes,storage nodes,decoding,distributed storage system,recovery scheme,generators,vectors,encoding | Sequential decoding,Berlekamp–Welch algorithm,Computer science,Parallel computing,Data collector,Computer network,Algorithm,Decoding methods,List decoding,Computational complexity theory,Encoding (memory) | Conference |
ISSN | Citations | PageRank |
2324-898X | 1 | 0.35 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ximing Fu | 1 | 1 | 0.35 |
| Zhiqing Xiao | 2 | 4 | 2.47 |
| Shenghao Yang | 3 | 33 | 13.84 |