Algorithmic complexity in coding theory and the minimum distance problem
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Reliability and performance of hierarchical RAID with multiple controllers
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A Practical Parity Scheme for Tolerating Triple Disk Failures in RAID Architectures
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
A multiple disk failure recovery scheme in RAID systems
Journal of Systems Architecture: the EUROMICRO Journal
IEEE Transactions on Computers
STAR: an efficient coding scheme for correcting triple storage node failures
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
GRID codes: Strip-based erasure codes with high fault tolerance for storage systems
ACM Transactions on Storage (TOS)
Higher reliability redundant disk arrays: Organization, operation, and coding
ACM Transactions on Storage (TOS)
Shortening array codes and the perfect 1-factorization conjecture
IEEE Transactions on Information Theory
T-code: 3-erasure longest lowest-density MDS codes
IEEE Journal on Selected Areas in Communications
F-code: an optimized MDS array code
ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
Key distribution protocol for secure multicast with reduced communication delay
AMT'11 Proceedings of the 7th international conference on Active media technology
Rethinking erasure codes for cloud file systems: minimizing I/O for recovery and degraded reads
FAST'12 Proceedings of the 10th USENIX conference on File and Storage Technologies
Key distribution for Pay-TV system with reduced computation cost using XOR operation
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
Generalized X-code: An efficient RAID-6 code for arbitrary size of disk array
ACM Transactions on Storage (TOS)
N-ary tree based key distribution in a network as a service provisioning model
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
ACM SIGOPS Operating Systems Review
What can coding theory do for storage systems?
ACM SIGACT News
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
Hi-index | 754.90 |
A new family of maximum distance separable (MDS) array codes is presented. The code arrays contain p information columns and r independent parity columns, each column consisting of p-1 bits, where p is a prime. We extend a previously known construction for the case r=2 to three and more parity columns. It is shown that when r=3 such extension is possible for any prime p. For larger values of r, we give necessary and sufficient conditions for our codes to be MDS, and then prove that if p belongs to a certain class of primes these conditions are satisfied up to r⩽8. One of the advantages of the new codes is that encoding and decoding may be accomplished using simple cyclic shifts and XOR operations on the columns of the code array. We develop efficient decoding procedures for the case of two- and three-column errors. This again extends the previously known results for the case of a single-column error. Another primary advantage of our codes is related to the problem of efficient information updates. We present upper and lower bounds on the average number of parity bits which have to be updated in an MDS code over GF (2m), following an update in a single information bit. This average number is of importance in many storage applications which require frequent updates of information. We show that the upper bound obtained from our codes is close to the lower bound and, most importantly, does not depend on the size of the code symbols