Locally rapairable codes (LRCs) are ingeniously designed distributed storage codes with a (usually small) bounded number of helper nodes participating in repair. Since most existing LRCs assume exact repair and allow full exchange of the stored data (β = α), they can be viewed as a generalization of the traditional erasure codes (ECs) with a much desired feature of local repair. However, it als...

We study a generalization of the setting of regenerating codes, motivated by applications to storage systems consisting of clusters of storage nodes. There are n clusters in total, with m nodes per cluster. A data file is coded and stored across the mn nodes, with each node storing α symbols. For availability of data, we demand that the file is retrievable by downloading the entire content from...

This short note revisits the problem of designing secure minimum storage regenerating (MSR) codes for distributed storage systems. A secure MSR code ensures that a distributed storage system does not reveal the stored information to a passive eavesdropper. The eavesdropper is assumed to have access to the content stored on l1 number of storage nodes in the system and the data downloaded during ...

Locally repairable codes (LRCs) are ingeniously designed distributed storage codes with a (usually small) bounded number of helper nodes participating in repair. Since most existing LRCs assume exact repair and allow full exchange of the stored data (β = α), they can be viewed as a generalization of the traditional erasure codes (ECs) with a much desired feature of local repair. However, it als...

We study the problem of centralized exact repair of multiple failures in distributed storage. We describe constructions that achieve a new set of interior points under exact repair. The constructions build upon the layered code construction by Tian et al in [1], designed for exact repair of single failure. We firstly improve upon the layered construction for general system parameters. Then, we ...

of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy RELIABILITY-BASED HYBRID-ARQ USING CONVOLUTIONAL CODES By Abhinav Roongta August 2005 Chair: John M. Shea Major Department: Electrical and Computer Engineering In this work we develop selective-retransmission hybrid-ARQ protocols for com...

We consider a hybrid automatic repeat-request (ARQ) scheme employing different space-time trellis codes. In general, most design criteria for space-time trellis codes focus on minimizing the maximum pairwise error probability. However, in slow fading channels, since the maximum pairwise error probability differs little from other pairwise error probabilties, proper design techniques have to con...

In clustered distributed storage systems (CDSSs), one of the main design goals is minimizing transmission cost during failed nodes repairing. Generalized regenerating codes (GRCs) are proposed to balance intra-cluster repair bandwidth and inter-cluster for guaranteeing data availability. The trade-off performance GRCs illustrates that, it can reduce overhead bandwidths simultaneously. However, ...

Minimum storage regenerating (MSR) codes form a special class of maximum distance separable (MDS) codes by providing mechanisms for exact regeneration of a single code block in their codewords by downloading the minimum amount of information from the remaining code blocks. As a result, the MSR codes find application to distributed storage systems to enable node repairs with the optimal repair b...