Name
Abstract | ||
|---|---|---|
Based on the research of MDS array code of size n×n in distributed storage system, in this paper, we present a novel encoding scheme called the F-code and prove that the column distance of the F-code is 3, i.e. F-code is a MDS array code given that odd number n is greater than 3 and does not include factor 3. And we also implement a novel decoding algorithm of the F-code. The algorithm only needs two decoding chains in each linear equation group and is able to recover all unknown symbols on two erasure columns. The analysis of F-code shows that our method extends the range of number n in n×n MDS array code and gets lower/reduction algorithmic complexity. Therefore, the reliability of a distributed storage system that features the F-code can be effectively reinforced. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-74171-8_135 | ICIC (1) |
Keywords | Field | DocType |
linear equation group,erasure column,storage system,decoding chain,column distance,size n,number n,n mds array code,mds array code,odd number n,optimized mds array code,linear equations | Linear equation,Computer science,Distributed data store,Algorithm,Decoding methods,Algorithmic complexity,Erasure,Encoding (memory) | Conference |
Volume | ISSN | ISBN |
4681 | 0302-9743 | 3-540-74170-4 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jianbo Fan | 1 | 8 | 4.06 |
| Lidan Shou | 2 | 370 | 48.66 |
| Jinxiang Dong | 3 | 311 | 65.36 |