F-code: an optimized MDS array code

Authors:
Jianbo Fan;Lidan Shou;Jinxiang Dong
Affiliations:
College of Electron & Information Engineering, Ningbo University of Technology, Zhejiang, Ningbo;College of Computer Science and Technology, Zhejiang University, Zhejiang, Hangzhou;College of Computer Science and Technology, Zhejiang University, Zhejiang, Hangzhou
Venue:
ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
Year:
2007

Citing 5
Cited 0

A case for redundant arrays of inexpensive disks (RAID)

SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Computing in the RAIN: A Reliable Array of Independent Nodes

IEEE Transactions on Parallel and Distributed Systems
Modified Low-Density MDS Array Codes for Tolerating Double Disk Failures in Disk Arrays

IEEE Transactions on Computers
MDS array codes with independent parity symbols

IEEE Transactions on Information Theory
X-code: MDS array codes with optimal encoding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.