Authors: Mario Blaum; Steven R. Hetzler
Addresses: IBM Research Division, Almaden Research Center, 650 Harry Road, San Jose, CA 95125, USA ' IBM Research Division, Almaden Research Center, 650 Harry Road, San Jose, CA 95125, USA
Abstract: Considerable interest has been paid in recent literature to codes combining local and global properties for erasure correction. Applications are in cloud type of implementations, in which fast recovery of a failed storage device is important, but additional protection is required in order to avoid data loss, and in RAID type of architectures, in which total device failures coexist with silent failures at the page or sector level in each device. Existing solutions to these problems require in general relatively large finite fields. The techniques of integrated interleaved codes (which are closely related to generalised concatenated codes) are proposed to reduce significantly the size of the finite field, and it is shown that when the parameters of these codes are judiciously chosen, they outperform codes optimising the minimum distance with respect to the average number of erasures that the code can correct.
Keywords: error-correcting codes; generalised concatenated codes; heavy parities; integrated interleaved codes; local global parities; maximally recoverable codes; MDS codes; PMDS codes; redundant arrays of independent disks; RAID; Reed-Solomon codes; locally recoverable codes; cloud computing.
International Journal of Information and Coding Theory, 2016 Vol.3 No.4, pp.324 - 344
Available online: 21 Sep 2016 *Full-text access for editors Access for subscribers Purchase this article Comment on this article