Recently we constructed an explicit family of locally repairable and locally regenerating codes. Their existence was proven by Kamath et al. but no explicit construction was given. Our design is based on HashTag codes that can have different sub-packetization levels. In this work we emphasize the importance of having two ways to repair a node: repair only with local parity nodes or repair with ...

background : in medical studies, when the joint prediction about occurrence of two events should be anticipated, a statistical bivariate model is used. due to the limitations of usual statistical models, other methods such as artificial neural network (ann) and hybrid models could be used. in this paper, we propose a hybrid artificial neural network-genetic algorithm (ann-ga) model to predictio...

This paper considers a distributed storage system, where multiple storage nodes can be reconstructed simultaneously at a centralized location. This centralized multi-node repair (CMR) model is a generalization of regenerating codes that allow for bandwidth-efficient repair of a single failed node. This work focuses on the trade-off between the amount of data stored and repair bandwidth in this ...

Distributed storage codes have important applications in the design of modern storage systems. In a distributed storage system, every storage node has a probability to fail and once an individual storage node fails, it must be reconstructed using data stored in the surviving nodes. Computation load and network bandwidth are two important issues we need to concern when repairing a failed node. T...

Clustered distributed storage models real data centers where intraand cross-cluster repair bandwidths are different. In this paper, exact-repair minimum-storage-regenerating (MSR) codes achieving capacity of clustered distributed storage are designed. Focus is given on two cases: = 0 and = 1/(n−k), where is the ratio of the available crossand intra-cluster repair bandwidths, n is the total numb...

In this paper, we propose a hybrid type-II Automatic Repeat reQuest (ARQ) scheme based on optimized Rate Compatible Punctured Convolutional (RCPC) codes combined with simple repetition codes. The proposed scheme has the prospect to provide high throughput over Rayleigh fading and AWGN channels. In order to design this scheme, di erent schemes based on di erent coding strategies were introduced ...

We outline a hybrid analog-digital scheme for computing with three important features that enable it to scale to systems of large complexity: First, like digital computation, which uses several one-bit precise logical units to collectively compute a precise answer to a computation, the hybrid scheme uses several moderate-precision analog units to collectively compute a precise answer to a compu...

in this paper, we consider a class of column-weight two quasi-cyclic low-density paritycheck codes in which the girth can be large enough, as an arbitrary multiple of 8. then we devote a convolutional form to these codes, such that their generator matrix can be obtained by elementary row and column operations on the parity-check matrix. finally, we show that the free distance of the convolution...

Erasure coding techniques are getting integrated in networked distributed storage systems as a way to provide fault-tolerance at the cost of less storage overhead than traditional replication. Redundancy is maintained over time through repair mechanisms, which may entail large network resource overheads. In recent years, several novel codes tailor-made for distributed storage have been proposed...

We consider a stochastic model for distributed network storage with highly volatile connectivity and node availability, common for edge/fog caching networks, and a random linear network coding (RLNC) scheme with varying levels of redundancy. The nodes store erasure-coded pieces of data and represent points of failure. Upon a node failure, the node is replaced by a new node, which regenerates th...