The explosion in data acquisition and storage has led to the emergence of data-intensive applications that are used to process enormous quantity of information using methods such as the MapReduce paradigm. Data-Intensive Distributed File Systems (DI-DFS) have been designed to support these kinds of applications. These large-scale storage systems require faulttolerance mechanisms to handle failu...

Vector Symbol Decoding (VSD) is compared with Reed-Solomon Decoding (RSD) as an outer code of a concatenated code for two examples, where the inner decoder may provide a combination of errors, erasures or list decisions for a symbol. One example is for idealized orthogonal inner code signals with random noise and soft inner code decisions. The other example is for multiple access fast frequency...

We present an efficient erasure decoding algorithm for generalized Reed Solomon codes constructed by utilizing the structure of the inverse of the VanderMonde matrices. Given an [n, k] generalized Reed Solomon code, decoding for r erasures, where r = n − k, requires rk + n Galois field multiplications and r(k − 1) Galois field additions after setting up the decoding structures for an erasure pa...

Two decoding procedures combined with a beliefpropagation (BP) decoding algorithm for low-density parity-check codes over the binary erasure channel are presented. These algorithms continue a decoding procedure after the BP decoding algorithm terminates. We derive a condition that our decoding algorithms can correct an erased bit which is uncorrectable by the BP decoding algorithm. We show by s...

Network transfer and disk read are the most time consuming operations in the repair process for node failures in erasure-code-based distributed storage systems. Recent developments on Reed-Solomon codes, the most widely used erasure codes in practical storage systems, have shown that efficient repair schemes specifically tailored to these codes can significantly reduce the network bandwidth spe...

This paper revisits strongly-MDS convolutional codes with maximum distance profile (MDP). These are (non-binary) convolutional codes that have an optimum sequence of column distances and attains the generalized Singleton bound at the earliest possible time frame. These properties make these convolutional codes applicable over the erasure channel, since they are able to correct a large number of...

The high repair cost of (n, k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off storage cost for repair bandwidth. On one end of this spectrum of Regenerating Codes are Minimum Storage Regenerating (MSR) codes that can match the minimum storage cost of MDS codes while also significantly reducing repai...

Attenuation and fading events can corrupt Free Space Optical (FSO) links. It would be so recommended to add mitigation error codes on the communication links. FSO channel can be described as an erasure channel (fading events can cause erasure errors), and we have identified in rateless codes (RCs) a suitable solution to be employed in FSO links. RCs do not need feedback and they add a redundant...

Distributed storage systems take advantage of the network, storage and computational resources to provide a scalable infrastructure. But in such large system, failures are frequent and expected. Data replication is the common technique to provide fault-tolerance but suffers from its important storage consumption. Erasure coding is an alternative that offers the same data protection but reduces ...