Regenerating codes are efficient methods for distributed storage in storage networks, where node failures are common. They guarantee low cost data reconstruction and repair through accessing only a predefined number of arbitrarily chosen storage nodes in the network. In this work we consider two simultaneous extensions to the original regenerating codes framework introduced in [1]; i) both data...

A novel hybrid genetic algorithm (GA) for jointly optimizing source and channel codes is presented in this paper. The algorithm first uses GA for the coarse search of source and channel codes. An iterative search is then followed for the refinement of the coarse search. The hybrid GA enhances the robustness of the design of source and channel codes. The distributed GA scheme can also be used in...

Distributed storage systems are becoming more and more popular with the rapidly increasing demand for large-scale data storage. To increase the capacity and I/O performance of a distributed storage system, scaling it up is a common method. Regenerating Codes are a class of distributed storage codes that offer good reliability through encoding and provide good bandwidth cost on failed nodes repa...

|In this work we studied the performance of the hybrid type-II Automatic Repeat reQuest (ARQ) system on Rayleigh fading channels. This system is based on High Rate Optimized Rate Compatible Punctured Convolutional (HRO-RCPC) codes combined with simple repetition codes. The performance is investigated for di erent packet sizes and constraint lengths of the convolutional encoder. Additionally the...

This paper presents an explicit construction of a class optimal-access, minimum storage regenerating (MSR) codes, for small values the number $d$ helper nodes. The is valid any parameter set notation="LaTeX">$(n,k,d)$ with notation="L...

In this paper, we propose a generalized version of the Rashmi-Shah-Kumar Minimum-Storage-Regenerating(RSKMSR) codes based on the product-matrix framework. For any (n, k, d) such that d ≥ 2k − 2 and d ≤ n − 1, we can directly construct an (n, k, d) MSR code without constructing a larger MSR code and shortening of the larger MSR code. As a result, the size of a finite field over which the propose...

Concatenating the state-of-the-art codes at moderate rates with repetition has emerged as a practical solution deployed in various standards for ultra-low-power devices such Internet-of-Things (IoT) networks. In this paper, we propose novel concatenation mechanism applications which need to operate very low signal-to-noise ratio (SNR) regime. proposed scheme, outer code is hybrid polar construc...

Heterogeneous Distributed Storage Systems (DSS) are close to real world applications for data storage. Internet caching system and peer-to-peer storage clouds are the examples of such DSS. In this work, we calculate the capacity formula for such systems where each node store different number of packets and each having a different repair bandwidth (node can be repaired by contacting a specific s...

We consider the problem of constructing exact-repair minimum storage regenerating (MSR) codes, for which both the systematic nodes and parity nodes can be repaired optimally. Although there exist several recent explicit high-rate MSR code constructions (usually with certain restrictions on the coding parameters), quite a few constructions in the literature only allow the optimal repair of syste...